Simplifying flow networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1893, Issue , 2000, Pages 192-201

  Biedl, Therese C ^a   Brejová, Broňa ^a   Vinař, Tomáś ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DIRECTED FLOW; FLOW NETWORK; MAXIMUM FLOW PROBLEMS; MAXIMUM FLOWS;

COMPLEX NETWORKS;

EID: 84959206882     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_15     Document Type: Conference Paper

References (9)

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, 1993.
2. Therese Biedl, Brona Brejova, and Tomas Vinar. Simplifying flow networks. Technical Report CS-2000-07, Department of Computer Science, University of Waterloo, 2000.
3. Steven Fortune, John Hopcroft, and James Wyllie. The directed subgraph homeo-morphism problem. Theoretical Computer Science, 10(2):111-121, February 1980.
4. Donald B. Johnson and Shankar M. Venkatesan. Using divide and conquer to find flows in directed planar networks in O(n3/2 log n) time. In Proceedings of the 20th Annual Allerton Conference on Communication,Control, and Computing, pages 898-905, University of Illinois, Urbana-Champaign, 1982.
5. Samir Khuller, Joseph Naor, and Philip Klein. The lattice structure of flow in planar graphs. SIAM Journal on Discrete Mathematics, 6(3):477-490, August 1993.
6. Franco P. Preparata and Micheal I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.
7. Alexander Schrijver. Finding k disjoint paths in a directed planar graph. SIAM Journal of Computing, 23(4):780-788, August 1994.
8. Daniel D. Sleator and Robert E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362-391, June 1983.
9. Karsten Weihe. Maximum (s,i)-flows in planar networks in O(\V\ log\V|) time. Journal of Computer and System Sciences, 55(3):454-475, December 1997.