A fast algorithm for computing minimum 3-way and 4-way cuts
From MaRDI portal
Publication:1587938
DOI10.1007/s101070000183zbMath0986.90068MaRDI QIDQ1587938
Hiroshi Nagamochi, Toshihide Ibaraki
Publication date: 28 February 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
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 ⋮ Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem ⋮ Generating partitions of a graph into a fixed number of minimum weight cuts ⋮ Finding minimum 3-way cuts in hypergraphs
This page was built for publication: A fast algorithm for computing minimum 3-way and 4-way cuts
