A Direct Algorithm for the Parameterized Face Cover Problem
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Simple and Fast Approach for Solving Problems on Planar GraphsLecture Notes in Computer Science, 2004
- Improved Parameterized Algorithms for Planar Dominating SetLecture Notes in Computer Science, 2002
- Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar GraphsAlgorithmica, 2002
- Refined Search Tree Technique for Dominating Set on Planar GraphsLecture Notes in Computer Science, 2001
- A general method to speed up fixed-parameter-tractable algorithmsInformation Processing Letters, 2000
- On Efficient Fixed Parameter Algorithms for Weighted Vertex CoverLecture Notes in Computer Science, 2000
- Parameterized ComplexityPublished by Springer Nature ,1999
- On the Complexity of Covering Vertices by Faces in a Planar GraphSIAM Journal on Computing, 1988