A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
From MaRDI portal
Publication:5422488
DOI10.1137/050631616zbMath1124.05083OpenAlexW1974139762MaRDI QIDQ5422488
Hiroshi Nagamochi, Noriyoshi Yoshida, Yoko Kamidoi
Publication date: 22 October 2007
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050631616
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (14)
Minimum cost subpartitions in graphs ⋮ Efficient algorithms for the problems of enumerating cuts by non-decreasing weights ⋮ Clique Cover and Graph Separation ⋮ Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity ⋮ Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions ⋮ Partitioning subclasses of chordal graphs with few deletions ⋮ Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems ⋮ Hypergraph \(k\)-cut in randomized polynomial time ⋮ LP Relaxation and Tree Packing for Minimum $k$-Cut ⋮ Computing minimum multiway cuts in hypergraphs ⋮ Finding minimum 3-way cuts in hypergraphs ⋮ Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs ⋮ Unnamed Item ⋮ Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
This page was built for publication: A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
