论文信息 - Two flow network simplification algorithms

Two flow network simplification algorithms

Flow network simplification can reduce the size of the flow network and hence the amount of computation performed by flow algorithms. We present the first linear time algorithm for the undirected network case. We also give an O(|E| × (|V| + |E|)) time algorithm for the directed case, an improvement over the previous best O(|V| + |E|2 log |V|) time solution. Both of our algorithms are quite simple.

Danny Ziyi Chen | Ewa Misiolek | D. Chen | Ewa Misiolek

[1] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[2] Therese C. Biedl,et al. Simplifying Flow Networks , 2000, MFCS.

[3] Uzi Vishkin,et al. On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[4] Mikkel Thorup,et al. Dominators in Linear Time , 1999, SIAM J. Comput..

[5] C. A. Lang. Programming languages for writing system programs , 1974 .

[6] Ken Kennedy,et al. AS imple, Fast Dominance Algorithm , 1999 .

[7] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[8] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .

[9] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.

[10] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[11] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .

[12] Udi Manber,et al. Introduction to algorithms - a creative approach , 1989 .

[13] Andrew V. Goldberg,et al. Recent Developments in Maximum Flow Algorithms (Invited Lecture) , 1998, SWAT.

[14] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .