Graph separators: a parameterized view
- 31 December 2003
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 67 (4), 808-832
- https://doi.org/10.1016/s0022-0000(03)00072-2
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar CaseLecture Notes in Computer Science, 2002
- Vertex Cover: Further Observations and Further ImprovementsJournal of Algorithms, 2001
- Approximation Algorithms for Independent Sets in Map GraphsJournal of Algorithms, 2001
- Graph Separators: A Parameterized ViewLecture Notes in Computer Science, 2001
- Faster exact algorithms for hard problems: A parameterized point of viewDiscrete Mathematics, 2001
- Fixed Parameter Algorithms for Planar Dominating Set and Related ProblemsLecture Notes in Computer Science, 2000
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- Linear Algorithms for Partitioning Embedded Graphs of Bounded GenusSIAM Journal on Discrete Mathematics, 1996
- A separator theorem for graphs with an excluded minor and its applicationsPublished by Association for Computing Machinery (ACM) ,1990
- On the Problem of Partitioning Planar GraphsSIAM Journal on Algebraic Discrete Methods, 1982