Computing mimicking networks

Algorithmica (New York)

Volumn 26, Issue 1, 2000, Pages 31-49

  Chaudhuri, S ^a   Subrahmanyam, K V ^a   Wagner, F ^b   Zaroliagis, C D ^a,c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Maximum flow; Mimicking network; Minimum cut; Multiterminal network; Network flow; Realizable external flow

Indexed keywords

EID: 0007124839     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004539910003     Document Type: Article

References (15)

1. R. Ahuja, T. Magnanti, and J. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. S. Arikati, S. Chaudhuri, and C. Zaroliagis, All-Pairs Min-Cut in Sparse Networks, Journal of Algorithms, 29 (1998), 82-110.
3. S. Amborg, Efficient Algorithms for Combinatorial Problems on Graphs with Bounded Decomposability - A Survey, BIT, 25 (1985), 2-23.
4. H. Bodlaender, A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth, in Proc. 25th ACM Symposium on Theory of Computing (STOC '93), ACM, New York, 1993, pp. 226-234.
5. H. Bodlaender, A Tourist Guide Through Treewidth, Acta Cybernetica, 11(1-2) (1993), 1-21.
6. C. K. Cheng and T. C. Hu, Maximum Concurrent Flows and Minimum Cuts, Algorithmica, 8 (1992), 233-249.
7. D. Gusfield, Very Simple Methods for All Pairs Network Flow Analysis, SIAM Journal on Computing, 19 (1990), 143-155.
8. R. E. Gomory and T. C. Hu, Multi-Terminal Network Flows, Journal of SIAM, 9 (1961), 551-570.
9. T. Hagerup, Private communication, 1997.
10. T. Hagerup, J. Katajainen, N. Nishimura, and P. Ragde, Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees, in Proc. 6th ACM-SIAM Symposium on Discrete Algorithms (SODA '95), ACM, New York, and SIAM, Philadelphia, PA, 1995, pp. 641-649.
11. E. Ihler, F. Wagner, and D. Wagner, Modeling Hypergraphs by Graphs with the Same Mincut Properties, Information Processing Letters, 45 (1993), 171-175.
12. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Teubner, Stuttgart, and Wiley, Chichester, 1990.
13. N. Robertson and P. Seymour, Graph Minors II: Algorithmic Aspects of Treewidth, Journal of Algorithms, 7 (1986), 309-322.
14. M. T. Shing and T. C. Hu, A Decomposition Algorithm for Multi-Terminal Network Flows, Discrete Applied Mathematics, 13 (1986), 165-181.
15. A. Vanneli and S. W. Hadley, A Gomory-Hu Cut Tree Representation of a Netlist Partitioning Problem, IEEE Transactions on Circuits and Systems, 37 (1990), 1133-1139.