A simple min cut algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 855 LNCS, Issue , 1994, Pages 141-147

  Stoer, Mechthild ^a   Wagner, Frank ^b  

^a Norwegian Teleeom Research ^*  (Germany)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EDGE-WEIGHTED GRAPH; MIN-CUT ALGORITHM; MINIMUM CUT; MINIMUM SPANNING TREES; NO FLOWS; PROOF OF CORRECTNESS; RUN-TIME ANALYSIS; RUNTIMES;

TREES (MATHEMATICS);

EID: 84887249319     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0049404     Document Type: Conference Paper

References (10)

1. M. L. FREDMAN and R. E. TARJAN, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM 34 (1987) 596-615
2. L. R. FORD, D. R. FULKERSON, Maximal flow through a network, Canadian Journal on Mathematics 8 (1956) 399-404
3. A. V. GOLDBERG and R. E. TARJAN, A new approach to the maximum flow problem, Journal of the ACM 35 (1988) 921-940
4. K. E. GOMORY, Multi-terminal network flows, Journal of the SIAM 9 (1961) 551-570
5. X. HAD and J. B. ORLIN, A faster algorithm for finding the minimum cut in a graph, 3rd ACM-SIAM Symposium on Discrete Algorithms (1992) 165-174
6. D. W. MATULA A linear time 2 + ε approximation algorithm for edge connectivity, Proceedings of the 4th ACM-SIAM Symposium on Discrete Mathematics (1993) 500-504
7. H. NAGAMOCHI and T. IBARAKI, Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica 7 (1992) 583-596
8. H. NAGAMOCHI and T. IBARAKI, Computing edge-connectivity in multigraphs and capacitated graphs, SIAM Journal on Discrete Mathematics 5 (1992) 54-66
9. T. NISHIZEKI and S. POLJAK, Highly connected factors with a small number of edges, Preprint (1989)
10. R. C. PRIM, Shortest connection networks and some generalizations, Bell System Technical Journal 36 (1957) 1389-1401