Improved Algorithms and Complexity Results for Power Domination in Graphs
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 172-184
- https://doi.org/10.1007/11537311_16
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar GraphsAlgorithmica, 2002
- Domination in Graphs Applied to Electric Power NetworksSIAM Journal on Discrete Mathematics, 2002
- Parameterized ComplexityPublished by Springer Nature ,1999
- Graph Classes: A SurveyPublished by Society for Industrial & Applied Mathematics (SIAM) ,1999
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- Treewidth: Algorithmic techniques and resultsPublished by Springer Nature ,1997
- TreewidthPublished by Springer Nature ,1994
- Practical algorithms on partial k-trees with an application to domination-like problemsLecture Notes in Computer Science, 1993