Maximum s-t-flow with k crossings in O(k3n log n) time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 843-847

  Hochstein, Jan M ^a   Weihe, Karsten ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; GRAPHIC METHODS; TOPOLOGY;

BEST-KNOWN ALGORITHMS; FLOW PROBLEMS; MAXIMUM CUT PROBLEMS; MAXIMUM-FLOW ALGORITHM; PLANAR GRAPH ALGORITHM; POLYNOMIALLY SOLVABLE; PREFLOW-PUSH ALGORITHMS; TOPOLOGICAL PARAMETERS;

ALGORITHMS;

EID: 70350646066     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows. Prentice-Hall, Englewood Cliffs, New Jersey, 1993.
2. Glencora Borradaile and Philip Klein. An O(n log n) algorithm for maximum st-flow in a directed planar graph. In SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithms, pages 524-533, 2006.
3. J. Cheriyan and S. N. Maheshwari. Analysis of preflow push algorithms for maximum network flow. SIAM J. Comput., 18(6):1057-1086, 1989.
4. Fedor V. Fomin and Dimitrios M. Thilikos. Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. In ICALP 2004: Automata, Languages and Programming: 31st International Colloquiumi, volume 3142 of Lecture Notes in Computer Science, pages 581-592, 2004.
5. M. Garey and D. Johnson. Computers and Intractability. W. H. Freeman & Co., San Francisco, 1979.
6. Andrew V. Goldberg and Robert Endre Tarjan. A new approach to the maximum-flow problem. J. ACM, 35(4):921-940, 1988.
7. J. L. Gross and T. W. Tucker. Topological Graph Theory. John Wiley and Sons, New York, 1987.
8. F. O. Hadlock. Finding a maximum cut of a planar graph in polynomial time. SIAM Journal on Computing, 4:221-225, 1975.
9. O(g)) steps. In STOC '79: Proceedings of the 11th annual ACM Symposium on the Theory of Computing, pages 27-37, 1979.
10. Martin Mareš. Two linear time algorithms for MST on minor closed graph classes. Archivum Mathematicum, 40(3):315-320, 2004.
11. Gary Miller. Isomorphism testing for graphs of bounded genus. In STOC '80: Proceedings of the twelfth annual ACM symposium on Theory of computing, pages 225-235, 1980.
12. G.I. Orlova and Y.G. Dorfman. Finding the maximum cut in a graph. Engineering Cybernetics, 10:502-506, 1972.
13. H. Ripphausen-Lipa, D. Wagner, and K. Weihe. Efficient algorithms for disjoint paths in planar graphs, volume 20, pages 295-354. American Mathematical Society, Providence, RI, 1995.
14. Karsten Weihe. Maximum (s, t)-flows in planar networks in O(|V | log |V |) time. Journal of Computer and System Sciences, 55(3):454-475, December 1997.