Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case
- 21 June 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 150-159
- https://doi.org/10.1007/3-540-45471-3_16
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Improved Tree Decomposition Based Algorithms for Domination-like ProblemsLecture Notes in Computer Science, 2002
- Parameterized Complexity: The Main Ideas and Some Research FrontiersLecture Notes in Computer Science, 2001
- Vertex Cover: Further Observations and Further ImprovementsJournal of Algorithms, 2001
- Refined Search Tree Technique for Dominating Set on Planar GraphsLecture Notes in Computer Science, 2001
- Graph Separators: A Parameterized ViewLecture Notes in Computer Science, 2001
- Parameterized Complexity: Exponential Speed-Up for Planar Graph ProblemsLecture 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
- Parameterized ComplexityPublished by Springer Nature ,1999
- Parameterized Computational FeasibilityPublished by Springer Nature ,1995