On the number of minimum cuts in a graph

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 1, 2004, Pages 177-194

  Chandran, L Sunil ^a   Ram, L Shankar ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b ETH ZURICH   (Switzerland)

Author keywords

Circular partition; Minimum cuts

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; DATA STRUCTURES; INTEGER PROGRAMMING; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

CIRCULAR PARTITION; MINIMUM CUTS; UNDIRECTED GRAPHS;

GRAPH THEORY;

EID: 14644417786     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103427138     Document Type: Article

References (31)

1. N. ALON, Eigenvalues and expanders, Combinatorica, 6 (1986), pp. 83-96.
2. N. ALON, S. HOORY, AND N. LINIAL, The Moore bound for irregular graphs, Graphs Combin., 18 (2002), pp. 53-57.
3. 1, isoperimetric inequalities for graphs, and superconcentrators, 3. Combin. Theory Ser. B, 38 (1985), pp. 73-88.
4. M. BALL AND J. PROVAN, Calculating bounds on reachability and connectedness in stochastic networks, Networks, 13 (1983), pp. 253-278.
5. J. PROVAN AND M. BALL, The complexity of counting cuts and of computing the probability that a graph is connected, SIAM J. Comput., 12 (1983), pp. 777-788.
6. M. BALL AND J. PROVAN, Computing network reliability in time polynomial in the number of cuts, Oper. Res., 32 (1984), pp. 516-521.
7. R. BIXBY, The minimum number of edges and vertices in a graph with edge connectivity n and m n-bonds, Networks, 5 (1975), pp. 253-298.
8. F. BOESCH, Synthesis of reliable networks - a survey, IEEE Trans. Reliability, R-35 (1986), pp. 240-246.
9. B. BOLLOBÁS, Extremal Graph Theory, London Math. Soc. Monogr. 11, Academic Press, London, New York, 1978.
10. A. BRANDSTÄDT, V. B. LE, AND J. P. SPINRAD, Graph Classes: A Survey, SIAM, Philadelphia, 1999.
11. L. S. CHANDRAN, A high girth graph construction, SIAM J. Discrete Math., 16 (2003), pp. 366-370.
12. E. DINIC, A. KARZANOV, AND M. LOMOSONOV, The structure of a system of minimal edge cuts of a graph, in Studies in Discrete Optimization, Nauka, Moscow, 1976, pp. 290-306 (in Russian).
13. M. FIEDLER, The algebraic connectivity of graphs, Czechoslovak Math J., 23 (1973), pp. 298-305.
14. L. FLEISCHER, Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time, J. Algorithms, 33 (1999), pp. 51-72.
15. H. GABOW, A matroid approach to finding edge connectivity and packing arborescences, J. Comput. System Sci., 50 (1995), pp. 259-273.
16. T. GALLAI, Transitiv orientierbare graphen, Acta. Math. Acad. Sci. Hungar., 18 (1967), pp. 25-66.
17. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
18. F. HARARY, Graph Theory, Addison-Wesley, Reading, MA, 1969.
19. R. B. HAYWARD, Weakly triangulated graphs, J. Combin. Theory Ser. B, 39 (1985), pp. 200-208.
20. M. HENZINGER AND D. WILLIAMSON, On the number of small cuts, Inform. Process. Lett., 59 (1996), pp. 41-44.
21. A. KANEVSKY, Graphs with Odd and Even Edge Connectivity Are Inherently Different, Tech. Rep. TAMU-89-10, Texas A & M University, College Station, TX, 1989.
22. D. KARGER, Random sampling in cut, flow, and network design problems, Math. Oper. Res., 24 (1999), pp. 383-413.
23. J. LEHEL, F. MAFFRAY, AND M. PREISSMANN, Graphs with largest number of minimum cuts, Discrete Appl. Math., 65 (1996), pp. 387-407.
24. A. LUBOTZKY, R. PHILLIPS, AND P. SARNAK, Ramanujan graphs, Combinatorica, 8 (1988), pp. 261-271.
25. B. MOHAR, Eigenvalues, diameter, and mean distance in graphs, Graphs. Combin., 7 (1991), pp. 53-64.
26. 2 log n) time and o(m) space, Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals, E86-D (2003), pp. 179-185.
27. H. NAGAMOCHI, K. NISHIMURA, AND T. IBARAKI, Computing all small cuts in an undirected network, SIAM J. Discrete Math., 10 (1997), pp. 469-481.
28. D. NAOR AND V. V. VAZIRANI, Representing and enumerating edge connectivity cuts in RNC, in Proceedings of the Second Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 519, Springer-Verlag, New York, 1991, pp. 273-285.
29. J. PICARD AND M. QUEYRANNE, On the structure of all minimum cuts in a network and applications, Math. Programming Stud., 13 (1980), pp. 8-16.
30. J. PROVAN, Bounds on the reliability of networks, IEEE Trans. Reliability, R-35 (1986), pp. 260-268.
31. V. V. VAZIRANI AND M. YANNAKAKIS, Suboptimal cuts: Their enumeration, weight, and number, in Proceedings of the 19th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 623, Springer-Verlag, New York, 1992, pp. 366-377.