论文信息 - Multiterminal Flows in Outerplanar Networks

Multiterminal Flows in Outerplanar Networks

Abstract An outerplanar network is an undirected network whose underlying graph is a triangulation of a polygon. We give a linear algorithm for finding maximum flow values between all pairs of nodes in the outerplanar network. Our algorithm constructs the cut-tree of the outerplanar network without using any maximum flow computation.

Man-tak Shing | T. C. Hu | M. Shing | T. C. Hu | M. T. Shing

[1] Frank Ruskey,et al. Circular Cuts in a Network , 1980, Math. Oper. Res..

[2] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .

[3] L. E. Trotter,et al. On the Generality of Multi-Terminal Flow Theory , 1977 .

[4] Yossi Shiloach. A Multi-Terminal Minimum Cut Algorithm for Planar Graphs , 1980, SIAM J. Comput..

[5] T. C. Hu. Optimum Communication Spanning Trees , 1974, SIAM J. Comput..

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

[7] Amnon Naamad,et al. Network flow and generalized path compression , 1979, STOC.

[8] D. Adolphson. Optimal linear-ordering. , 1973 .

[9] S. N. Maheshwari,et al. An O(|V|³) Algorithm for Finding Maximum Flows in Networks , 1978, Inf. Process. Lett..

[10] Robert E. Tarjan,et al. Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[11] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[12] Man-Tak Shing,et al. Computation of Matrix Chain Products. Part II , 1984, SIAM J. Comput..

[13] S. Vajda,et al. Integer Programming and Network Flows , 1970 .