Open Access
A note on Baker's algorithm
Iyad A. Kanj,Ljubomir Perkovic,S. Wabash Avenue +2 more
- 01 Jan 2004
TL;DR: In this article, a corrected version of Baker's algorithm for finding a minimum dominating set in an l-outerplanar graph is presented, and the algorithm is shown to be correct.
read more
Abstract: We present a corrected version of Baker’s algorithm for finding a minimum dominating set in an l-outerplanar graph.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Compendium of Parameterized Problems
Marco Cesati
- 01 Jan 2006
TL;DR: This document includes a list of computational problems that have been studied within the framework of parameterized complexity, mainly based on “A Compendium of Parameterized Complexity Results”, version 2.0, by Michael T. Hallett and H. Todd Wareham and on Downey and Fellows’ book.
References
Approximation algorithms for NP-complete problems on planar graphs
TL;DR: A general technique that can be used to obtain approximation algorithms for various NP-complete problems on planar graphs, which includes maximum independent set, maximum tile salvage, partition into triangles, maximum H-matching, minimum vertex cover, minimum dominating set, and minimum edge dominating set.
1.1K
Approximation algorithms for NP-complete problems on planar graphs
Brenda S. Baker
- 07 Nov 1983
TL;DR: A general technique that can be used to obtain approximation algorithms for various NP-complete problems on planar graphs, which includes maximum independent set, maximum tile salvage, partition into triangles, maximum H-matching, minimum vertex cover, minimum dominating set, and minimum edge dominating set.
602
Parameterized complexity: exponential speed-up for planar graph problems
TL;DR: General techniques that allow to develop algorithms with running time c√k|G|, given an instance G of a problem on planar graphs with parameter k are discussed, and extensions of the speed-up technique to basically all fixed-parameter tractable planar graph problems are exhibited.
134
•Journal Article
Improved parameterized algorithms for planar dominating set
Iyad A. Kanj,Ljubomir Perkovic +1 more
TL;DR: These algorithms induce a significant improvement over the previous best algorithm for the problem and can compute a dominating set of size bounded by k or report that no such set exists in time O(227?kn), where n is the number of vertices in G.
66
Improved Parameterized Algorithms for Planar Dominating Set
Iyad A. Kanj,Ljubomir Perkovic +1 more
- 26 Aug 2002
TL;DR: In this article, a planar dominating set of size bounded by k or report that no dominating set exists in time O(227?kn), where n is the number of vertices in G.
63