scientific article; zbMATH DE number 2081002

MaRDI QIDQ4474100zbMATH OpenFDO

Authors Danny Z. Chen, Xiaodong Wu

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230332.htm

Mathematics Subject Classification ID

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

Recommendations

• Efficient algorithms for \(k\)-terminal cuts on planar graphs
• Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
• The planar multiterminal cut problem
• The Complexity of Multiterminal Cuts
• An improved algorithm for the planar 3-cut problem

Cited in

(8)

• The planar multiterminal cut problem
• Efficient algorithms for \(k\)-terminal cuts on planar graphs
• A simple algorithm for the planar multiway cut problem
• Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
• scientific article; zbMATH DE number 4195169 (Why is no real title available?)
• Polynomial-time approximation scheme for minimum \(k\)-cut in planar and minor-free graphs
• A polynomial-time approximation scheme for planar multiway cut
• Revisiting a simple algorithm for the planar multiterminal cut problem

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 Q4474100)