A new and improved algorithm for the 3-cut problem

Operations Research Letters

Volumn 21, Issue 5, 1997, Pages 225-227

  Burlet, Michel ^a   Goldschmidt, Olivier ^a,b  

^a Équipe VAlidation Spécification et COnstruction de logiciels   (France)

^b NONE   (United States)

Author keywords

Min cut

Indexed keywords

ALGORITHMS; GRAPH THEORY;

MINIMUM CUT PROBLEMS;

OPERATIONS RESEARCH;

EID: 0031342280     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(97)00043-6     Document Type: Article

References (5)

1. O. Goldschmidt, D.S. Hochbaum, A polynomial time algorithm for the k-cut Problem for k fixed, Math. Oper. Res. 19 (1) (1994) 24-37.
2. H. Nagamochi, T. Ibaraki, Computing edge connectivity in multigraphs and capacitated graphs, SIAM J. Discrete Math. 5 (1992) 54-66.
3. H. Nagamochi, K. Nishimura, T. Ibaraki, Computing all small cuts in undirected networks, in: Ding-Zhu Du, Xiang-Sun Zhang (Eds.), Lectures Notes in Computer Science, vol. 834, Springer, Berlin, Algorithms and Computation, ISAAC'94, 1994, pp. 190-198.
4. C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
5. Pulleyblank, Presentation at SIAM Meeting on Optimization, MIT, Boston, 1982.