A simple algorithm for multicuts in planar graphs with outer terminals
Author:
- Cédric BentzCBCédric Bentz
- 28 April 2009
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 157 (8) , 1959-1964
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On the complexity of the multicut problem in bounded tree-width graphs and digraphsDiscrete Applied Mathematics, 2008
- Multiway cuts in node weighted graphsJournal of Algorithms, 2004
- Efficient Algorithms for k-Terminal Cuts on Planar GraphsAlgorithmica, 2003
- Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-widthJournal of Algorithms, 2003
- Primal-dual approximation algorithms for integral flow and multicut in treesAlgorithmica, 1997
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their ApplicationsSIAM Journal on Computing, 1996
- The Complexity of Multiterminal CutsSIAM Journal on Computing, 1994
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Edge-disjoint paths in planar graphsJournal of Combinatorial Theory, Series B, 1985
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956