论文信息 - A note on Baker's algorithm - 字舞流文

A note on Baker's algorithm

We present a corrected version of Baker’s algorithm for finding a minimum dominating set in an l-outerplanar graph.

Iyad A. Kanj | S. Avenue | L. Perkovic | Ljubomir Perkovic

[1] Henning Fernau,et al. A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs , 2004, MFCS.

[2] Dimitrios M. Thilikos,et al. A Simple and Fast Approach for Solving Problems on Planar Graphs , 2004, STACS.

[3] Dimitrios M. Thilikos,et al. Dominating sets in planar graphs: branch-width and exponential speed-up , 2003, SODA '03.

[4] Ljubomir Perkovic,et al. Improved Parameterized Algorithms for Planar Dominating Set , 2002, MFCS.

[5] Rolf Niedermeier,et al. Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.

[6] Rolf Niedermeier,et al. Parameterized complexity: exponential speed-up for planar graph problems , 2001, J. Algorithms.

[7] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[8] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .