Flow equivalent trees in undirected node-edge-capacitated planar graphs

Information Processing Letters

Volumn 100, Issue 3, 2006, Pages 110-115

  Zhang, Xianchao ^a,b   Liang, Weifa ^a   Jiang, He ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Data structures; Flow equivalent tree; Graph algorithms; Minimum cut; Node edge capacitated; Planar graphs

Indexed keywords

ALGORITHMS; DATA STRUCTURES; MATHEMATICAL TRANSFORMATIONS; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

FLOW EQUIVALENT TREE; GRAPH ALGORITHMS; MINIMUM CUT; NODE-EDGE-CAPACITATED; PLANAR GRAPHS;

GRAPH THEORY;

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

References (5)

1. Ahujia R.K., Magnanti T.L., and Orlin J.B. Network Flows: Theory, Algorithms and Applications (1993), Prentice-Hall, New Jersey
2. Benczúr A.A. Counterexamples for directed and node capacitated cut-trees. SIAM Journal on Computing 24 (1995) 505-510
3. Frank H., and Frisch I.T. Communication, Transmission and Transportation Networks (1971), Addison-Wesley, Reading, MA
4. Gomory R.E., and Hu T.C. Multi-terminal network flows. Journal of the SIAM 9 (1961) 551-570
5. 2 n) time. SIAM Journal on Computing 12 (1983) 71-81