Fixed Parameter Algorithms for Planar Dominating Set and Related Problems
Authors:
- 1 January 2000
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 97-110
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Vertex Cover: Further Observations and Further Improvements1999
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc GraphsSIAM Journal on Computing, 1998
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- Independent sets in asteroidal triple-free graphsLecture Notes in Computer Science, 1997
- Treewidth: Algorithmic techniques and results1997
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Parameterized Computational Feasibility1995
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Dominating sets in perfect graphsDiscrete Mathematics, 1990
- On the Complexity of Covering Vertices by Faces in a Planar GraphSIAM Journal on Computing, 1988