Autor:	Hlava, Björn
Rok vydání:	2013
Předmět:	Computer Science - Data Structures and Algorithms
Druh dokumentu:	Working Paper
Popis:	I introduce a new approach to the maximum flow problem by a simple algorithm with a slightly better runtime. This approach is based on sorting arcs insight of vertices on a residual graph. This new approach leads to an O(mn^0.5) time bound for a network with n vertices and m arcs. Category: Algorithms, Graph Theory and maximum flows Comment: preprint. uploaded to make sure, that this idea will not be stolen
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1302.3035 Zobrazit plný text záznamu View this record from Arxiv