scientific article; zbMATH DE number 1522944

zbMATH Open0964.68112MaRDI QIDQ4511240FDOQ4511240

Authors: Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki 

Publication date: 30 October 2000

Title of this publication is not available (Why is that?)

Recommendations

• Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
• scientific article; zbMATH DE number 1372653
• A divide-and-conquer approach to the minimum \(k\)-way cut problem.
• scientific article; zbMATH DE number 1342143
• On minimum 3-cuts and approximating k-cuts using cut trees

zbMATH Keywords

edge weighted undirected graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited In (8)

• An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
• Title not available (Why is that?)
• Finding k Cuts within Twice the Optimal
• A nearly 5/3-approximation FPT Algorithm for Min-k-Cut
• A divide-and-conquer approach to the minimum \(k\)-way cut problem.
• Minimum cost subpartitions in graphs
• Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
• Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511240)