Yet another approach to the Maximum Flow
Data Structures and Algorithms
2013-02-14 v1
Abstract
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
Keywords
Cite
@article{arxiv.1302.3035,
title = {Yet another approach to the Maximum Flow},
author = {Björn Hlava},
journal= {arXiv preprint arXiv:1302.3035},
year = {2013}
}
Comments
preprint. uploaded to make sure, that this idea will not be stolen