A divide-and-conquer approach to the minimum \(k\)-way cut problem.

DOI10.1007/S00453-001-0070-2zbMath1049.90109OpenAlexW1572441411MaRDI QIDQ5957576

Noriyoshi Yoshida, Yoko Kamidoi, S. Wakabayashi

Publication date: 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0070-2

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Efficient algorithms for the problems of enumerating cuts by non-decreasing weights ⋮ Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions ⋮ Efficient Algorithms for the k Smallest Cuts Enumeration ⋮ Generating partitions of a graph into a fixed number of minimum weight cuts ⋮ Hypergraph \(k\)-cut in randomized polynomial time ⋮ Finding minimum 3-way cuts in hypergraphs

This page was built for publication: A divide-and-conquer approach to the minimum \(k\)-way cut problem.