A faster algorithm for computing minimum 5-way and 6-way cuts in graphs

DOI10.1023/A:1009804919645zbMath1028.90074OpenAlexW1529019776MaRDI QIDQ1583693

Toshihide Ibaraki, Shigeki Katayama, Hiroshi Nagamochi

Publication date: 30 October 2000

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009804919645

zbMATH Keywords

graphspolynomial algorithmminimum cuts\(k\)-way cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

On generalized greedy splitting algorithms for multiway partition problems ⋮ Efficient algorithms for the problems of enumerating cuts by non-decreasing weights ⋮ Efficient Algorithms for the k Smallest Cuts Enumeration ⋮ Generating partitions of a graph into a fixed number of minimum weight cuts

This page was built for publication: A faster algorithm for computing minimum 5-way and 6-way cuts in graphs