A simple min-cut algorithm
From MaRDI portal
Publication:4377588
DOI10.1145/263867.263872zbMath0891.68071WikidataQ56572243 ScholiaQ56572243MaRDI QIDQ4377588
Publication date: 17 February 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1997-44/
68R10: Graph theory (including graph drawing) in computer science
Related Items
Graph connectivity and its augmentation: Applications of MA orderings, Minimum degree orderings, Complexity of the min-max (regret) versions of min cut problems, Minimizing symmetric submodular functions, Inverse maximum capacity problems, A note on the minimization of symmetric and general submodular functions, Weight reduction problems with certain bottleneck objectives., Cardinality constrained minimum cut problems: complexity and algorithms., Parametric analysis of overall min-cuts and applications in undirected networks., The prize-collecting generalized minimum spanning tree problem, A new?old algorithm for minimum-cut and maximum-flow in closure graphs, Minimum Cuts of Simple Graphs in Almost Always Linear Time
Uses Software