Practical performance of efficient minimum cut algorithms

DOI10.1007/s004539910009zbMath0949.68604OpenAlexW2002516237WikidataQ58002922 ScholiaQ58002922MaRDI QIDQ1969951

Michael Jünger, Giovanni Rinaldi, Stefan Thienel

Publication date: 19 March 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://kups.ub.uni-koeln.de/54788/1/zpr97-271.pdf

zbMATH Keywords

minimum capacity cut problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (9)

Efficient algorithms for the problems of enumerating cuts by non-decreasing weights ⋮ Simplifying maximum flow computations: the effect of shrinking and good initial flows ⋮ Unnamed Item ⋮ Generating partitions of a graph into a fixed number of minimum weight cuts ⋮ Practical Minimum Cut Algorithms ⋮ On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms ⋮ Computing finest mincut partitions of a graph and application to routing problems ⋮ A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions ⋮ A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation

Uses Software

• QAPLIB
• TSPLIB
• GraphBase
• MIPLIB

This page was built for publication: Practical performance of efficient minimum cut algorithms