All-Pairs Min-Cut in Sparse Networks

Journal of Algorithms

Volumn 29, Issue 1, 1998, Pages 82-110

  Arikati, Srinivasa R ^a   Chaudhuri, Shiva ^b   Zaroliagis, Christos D ^b  

^a University of Memphis   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347130103     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0961     Document Type: Article

References (23)

1. R. Ahuja, T. Magnanti, and J. Orlin, "Network Flows," Prentice-Hall, 1993.
2. N. Alon and B. Schieber, "Optimal Preprocessing for Answering On-line Product Queries," Technical Report 71/87, Tel-Aviv University, 1987.
3. S. Arikati, S. Chaudhuri, and C. Zaroliagis, All-pairs min-cut in sparse networks, in "Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'95)," LNCS 1026, pp. 363-376, Springer-Verlag, Berlin/New York, 1995.
4. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey, BIT 25 (1985), 2-23.
5. H. Bodlaender, NC-algorithms for graphs with small treewidth, in "Proceedings of the 14th Workshop on Graph-Theoretic Concepts in Computer Science (WG'88)," LNCS 344, pp. 1-10, Springer-Verlag, Berlin/New York, 1989.
6. H. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, in "Proceedings of the 25th ACM Symposium on Theory of Computing (STOC'93)," pp. 226-234, Assoc. Comput. Mach., New York, 1993.
7. H. Bodlaender, A tourist guide through treewidth, Acta Cybernet. 11(1-2) (1993), 1-21.
8. S. Chaudhuri and C. Zaroliagis, Shortest path queries in digraphs of small treewidth, in "Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP'95)," LNCS 944, pp. 244-255, Springer-Verlag, Berlin/New York, 1995.
9. B. Chazelle, Computing on a free tree via complexity-preserving mappings, Algorithmica 2 (1987), 337-361.
10. J. Cheriyan, T. Hagerup, and K. Mehlhorn, Can a maximum flow be computed on o(nm) time? in "Proceedings of the 17th Colloquium on Automata, Languages and Programming (ICALP'90)," LNCS 443, pp. 235-248, Springer-Verlag, Berlin/New York, 1990.
11. H. Djidjev, G. Pantziou, and C. Zaroliagis, On-line and dynamic algorithms for shortest path problems, in "Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science (STACS'95)," LNCS 900, pp. 193-204, Springer-Verlag, Berlin/New York, 1995.
12. L. R. Ford and D. R. Fulkerson, Maximal flow through a network, Canad. J. Math. 8 (1956), 399-404.
13. G. N. Frederickson, Searching among intervals and compact routing tables, in "Proceedings of the 20th Colloquium on Automata, Languages and Programming (ICALP'93)," LNCS 700, pp. 28-39, Springer-Verlag, Berlin/New York, 1993.
14. G. N. Frederickson, Using cellular graph embeddings in solving all pairs shortest path problems, J. Algorithms 19 (1995), 45-85.
15. D. Gusfield, A graph theoretic approach to statistical data security, SIAM J. Comput. 17 (1988), 552-571.
16. T. Hagerup, J. Katajainen, N. Nishimura, and P. Ragde, Characterizations of k-terminal flow networks and computing network flows in partial k-trees, in "Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms (SODA'95)," pp. 641-649, Assoc. Comput. Mach., New York, and SIAM, Philadelphia, 1995.
17. R. E. Gomory and T. C. Hu, Multi-terminal network flows, J. SIAM 9 (1961), 551-570.
18. P. Klein, S. Rao, M. Rauch, and S. Subramanian, Faster shortest-path algorithms for planar graphs, in "Proceedings of the 26th ACM Symposium on Theory of Computing (STOC'94)," pp. 27-37, Assoc. Comput Mach., New York, 1994.
19. N. Robertson and P. D. Seymour, Graph minors - a survey, in "Surveys in Combinatorics," pp. 153-171, Cambridge Univ. Press, Cambridge, 1985.
20. D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees, J. Comput. Syst. Sci. 26 (1983), 362-391.
21. R. E. Tarjan, "Data Structures and Network Algorithms," SIAM, Philadelphia, 1983.
22. K. Wagner, Über eine Eigenschaft der ebenen Komplexe, Math. Ann. 114 (1937), 570-590.
23. K. Weihe, Maximum (s, t)-flows in planar networks in O(|V|log|V|) time, in "Proceedings of the 35th IEEE Symposium on Foundations of Computer Science (FOCS'94," pp. 178-189, IEEE Comput. Soc., Los Alamitos, CA, 1994.