Refined Search Tree Technique for Dominating Set on Planar Graphs
- 5 September 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 111-123
- https://doi.org/10.1007/3-540-44683-4_11
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A general method to speed up fixed-parameter-tractable algorithmsInformation Processing Letters, 2000
- Fixed Parameter Algorithms for Planar Dominating Set and Related ProblemsLecture Notes in Computer Science, 2000
- Parameterized complexity: A framework for systematically confronting computational intractabilityPublished by American Mathematical Society (AMS) ,1999
- Parameterized ComplexityPublished by Springer Nature ,1999
- Parameterized Computational FeasibilityPublished by Springer Nature ,1995