Two flow network simplification algorithms

Information Processing Letters

Volumn 97, Issue 5, 2006, Pages 197-202

  Misiołek, Ewa ^a,b   Chen, Danny Z ^b  

^a SAINT MARY'S COLLEGE   (United States)

^b University of Notre Dame   (United States)

Author keywords

Flow networks; Graph algorithms; Maximum flow

Indexed keywords

COMPUTATIONAL METHODS; DATA PROCESSING;

FLOW NETWORKS; GRAPH ALGORITHMS; MAXIMUM FLOW;

ALGORITHMS;

EID: 30344466354     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.11.002     Document Type: Article

References (14)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman The Design and Analysis of Computer Algorithms 1974 Addison-Wesley Reading, MA
2. R. Ahuja, T. Magnanti, and J. Orlin Network Flows: Theory, Algorithms and Applications 1993 Prentice-Hall Englewood Cliffs, NJ
3. S. Alstrup, D. Harel, P. Lauridsen, and M. Thorup Dominators in linear time SIAM J. Comput. 28 6 1999 2117 2132
4. T. Biedl, B. Brejová, and T. Vinař Simplifying flow networks Proc. 25th Internat. Symp. on Mathematical Foundations of Computer Science Lecture Notes in Comput. Sci. vol. 1893 2000 Springer Berlin 202 211
5. K. Cooper, T. Harvey, and K. Kennedy A simple, fast dominance algorithm Softw. Pract. Exper. 4 2001 1 10
6. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms second ed. 2001 McGraw-Hill New York
7. L.R. Ford, and D.R. Fulkerson Flows in Networks 1962 Princeton University Press Princeton, NJ
8. A. Goldberg, Recent developments in maximum flow algorithms, Technical Report #98-045, NEC Research Institute, 1998
9. F. Harary, and G. Prins The block-cutpoint-tree of a graph Publ. Math. Debrecen 13 1966 103 107
10. D. Harel, and R.E. Tarjan Fast algorithms for finding nearest common ancestors SIAM J. Comput. 13 1984 338 355
11. E.L. Lawler Combinatorial Optimization: Networks and Matroids 1976 Holt, Rinehart, and Winston New York
12. U. Manber Introduction to Algorithms, A Creative Approach 1989 Addison-Wesley Reading, MA
13. B. Schieber, and U. Vishkin On finding lowest common ancestors: Simplification and parallelization SIAM J. Comput. 17 6 1988 1253 1262
14. D.D. Sleator, and R.E. Tarjan A data structure for dynamic trees J. Comput. System Sci. 26 3 1983 362 391