Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
- 30 November 2016
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 78 (4) , 1206-1224
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- ANR (ANR-12-BS02-005 (RDAM))
This publication has 28 references indexed in Scilit:
- A Polynomial-time Approximation Scheme for Planar Multiway Cut2012
- Homology Flows, Cohomology CutsSIAM Journal on Computing, 2012
- Multicut is FPT2011
- Shortest Cut Graph of a Surface with Prescribed Vertex SetLecture Notes in Computer Science, 2010
- Minimum cuts and shortest homologous cycles2009
- A simple algorithm for multicuts in planar graphs with outer terminalsDiscrete Applied Mathematics, 2009
- Splitting (complicated) surfaces is hardComputational Geometry, 2008
- On the complexity of the multicut problem in bounded tree-width graphs and digraphsDiscrete Applied Mathematics, 2008
- Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-widthJournal of Algorithms, 2003
- Dynamic programming on graphs with bounded treewidth1988