Parameterized Graph Separation Problems
Author:
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 71-82
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Multiway cuts in node weighted graphsJournal of Algorithms, 2004
- Parameterized Complexity1999
- Primal-dual approximation algorithms for integral flow and multicut in treesAlgorithmica, 1997
- Finding and counting given length cyclesAlgorithmica, 1997
- The Complexity of Multiterminal CutsSIAM Journal on Computing, 1994
- Finding good approximate vertex and edge partitions is NP-hardInformation Processing Letters, 1992
- The optimal multiterminal cut problem1991
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979