Max flows in O(nm) time, or better

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 765-774

  Orlin, James B ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Max flows; Maximum flow problem

Indexed keywords

MAX FLOWS; MAX-FLOW PROBLEM; MAXIMUM FLOW PROBLEMS; POLYNOMIAL-TIME ALGORITHMS; RUNNING TIME; SPARSE NETWORK;

COMPUTATION THEORY;

PROBLEM SOLVING;

EID: 84879817150     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488705     Document Type: Conference Paper

References (10)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows. Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
2. G. Blelloch, V. Vassilevska, and R. Williams. A new combinatorial approach for sparse graph problems. Automata, Languages and Programming, pages 108-120, 2008.
3. B. Chandran and D. Hochbaum. A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem. Operations research, 57(2):358, 2009.
4. B. Cherkassky and A. Goldberg. On implementing the push-relabel method for the maximum flow problem. Algorithmica, 19(4):390-410, 1997.
5. L. R. Ford and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399-404, 1956.
6. H. Gabow and R. Tarjan. A linear-time algorithm for a special case of disjoint set union. Journal of computer and system sciences, 30(2):209-221, 1985.
7. A. V. Goldberg and S. Rao. Beyond the flow decomposition barrier. Journal of the ACM, 45:783-797, 1998.
8. G. Italiano. Amortized efficiency of a path retrieval data structure. Theoretical Computer Science, 48(0):273-281, 1986.
9. V. King, S. Rao, and R. Tarjan. A faster deterministic maximum flow algorithm. J. Algorithms, 23:447-474, 1994.
10. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. J. Computer and System Sciences, 24:362-391, 1983.