Computing all small cuts in AN undirected network

SIAM Journal on Discrete Mathematics

Volumn 10, Issue 3, 1997, Pages 469-481

  Nagamochi, Hiroshi ^a   Nishimura, Kazuhiro ^b   Ibaraki, Toshihide ^a  

^a KYOTO UNIVERSITY   (Japan)

^b TOYOTA MOTOR CORPORATION   (Japan)

Author keywords

Edge splitting; Graphs; Minimum cuts; Polynomial algorithm

Indexed keywords

EID: 0041426088     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480194271323     Document Type: Article

References (17)

1. R. BIXBY, The minimum number of edges and vertices in a graph with edge-connectivity n and m n-bonds, Networks, 5 (1975), pp. 235-298.
2. C. J. COLBOURN, The Combinatorics of Network Reliability, Oxford University Press, New York Oxford, 1987.
3. E. DINITS, A. V. KARZANOV, AND M. V. LOMONOSOV, On the structure of a family of minimal weighed cuts in a graph, in Studies in Discrete Optimization, A. A. Fridman, ed., Nauka, Moscow, 1976, pp. 290-306 (in Russian).
4. A. FRANK, Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Math., 5 (1992), pp. 25-53.
5. A. FRANK, On a theorem of Mader, Discrete Math., 101 (1992), pp. 49-57.
6. A. FRANK, On the Edge-Connectivity Algorithm of Nagamochi and Ibaraki, Laboratoire Artemis, IMAG, Université J. Fourier, Grenoble, March, 1994.
7. S. FUJISHIGE, A note on Nagamochi and Ibaraki's min-cut algorithm and its simple proofs by Stoer, Wagner and Prank, manuscript, Forschungsinstitut für Diskrete Mathematik, Universität Bonn, June, 1994.
8. H. N. GABOW, Efficient splitting off algorithms for graphs, in Proceedings of the 26th ACM Symposium on Theory of Computing, Montreal, Quebec, 1994, pp. 696-705.
9. M. R. HENZINGER AND D. WILLIAMSON, On the number of small cuts, Inform. Process. Lett., 59 (1996), pp. 41-44.
10. D. R. KARGER, Global min-cuts m RNC, and other ramifications of a simple min-cut algorithm, in Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, 1993, pp. 21-30.
11. L. LOVÁSZ, Combinatorial Problems and Exercises, North-Holland, Amsterdam, 1979.
12. W. MADER, A reduction method for edge-connectivity in graphs, Ann. Discrete Math., 3 (1978), pp. 145-164.
13. H. NAGAMOCHI AND T. IBARAKI, Computing the edge-connectivity of multigraphs and capacitated graphs, SIAM J. Discrete Math., 5 (1992), pp. 54-66.
14. H. NAGAMOCHI, T. ISHII, AND T. IBARAKI, A Simple and Constructive Proof of a Minimum Cut Algorithm, Technical Report 96001, Department of Applied Mathematics and Physics, Kyoto University, 1996.
15. D. NAOR, D. GUSFIELD, AND C. MARTEL, A fast algorithm for optimally increasing the edge connectivity, in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, St. Louis, MO, 1990, pp. 698-707.
16. M. STOER AND F. WAGNER, A simple min cut algorithm, Lecture Notes in Comput. Sci., 855 (1994), pp. 141-147.
17. V. V. VAZIRANI AND M. YANNAKAKIS, Suboptimal cuts: Their enumeration, weight, and number, Lecture Notes in Comput. Sci., 623 (1992), pp. 366-377.