Dominating Sets and Local Treewidth

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2832, Issue , 2003, Pages 221-229

  Fomin, Fedor V ^a   Thilikos, Dimtirios M ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; GRAPHIC METHODS;

DOMINATING SETS; FIXED-PARAMETER ALGORITHMS; GRAPH G; LOCAL TREEWIDTH; PLANAR GRAPH; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 0142152737     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_22     Document Type: Article

References (18)

1. J. ALBER, H. L. BODLAENDER, H. FERNAU, T. KLOKS, AND R. NIEDERMEIER, Fixed parameter algorithms for dominating set and related problems on planar graphs, Algorithmica, 33 (2002), pp. 461-493.
2. J. ALBER, H. FAN, M. FELLOWS, AND R. H. FERNAU NIEDERMEIER, Refined search tree technique for dominating set on planar graphs, in Mathematical Foundations of Computer Science-MFCS 2001, Springer, vol. 2136, Berlin, 2000, pp. 111-122.
3. E. AMIR, Efficient approximation for triangulation of minimum treewidth, in Uncertainty in Artificial Intelligence: Proceedings of the Seventeenth Conference (UAI-2001), San Francisco, CA, 2001, Morgan Kaufmann Publishers, pp. 7-15.
4. B. S. BAKER, Approximation algorithms for NP-complete problems on planar graphs, J. Assoc. Comput. Mach., 41 (1994), pp. 153-180.
5. H. L. BoDLAENDER, A tourist guide through treewidth, Acta Cybernetica, 11 (1993), pp. 1-23.
6. 5-minor- free graphs, in The 13th Anual International Symposium on Algorithms and Computation - ISAAC 2002 (Vancouver, Canada), Springer, Lecture Notes in Computer Science, Berlin, vol.2518, 2002, pp. 262-273.
7. R. DIESTEL, Graph theory, vol. 173 of Graduate Texts in Mathematics, Springer-Verlag, New York, second ed., 2000.
8. R. DIESTEL, T. R. JENSEN, K. Y. GORBUNOV, AND C. THOMASSEN, Highly connected sets and the excluded grid theorem, J. Combin. Theory Ser. B, 75 (1999), pp. 61-73.
9. R. G. DOWNEY AND M. R. FELLOWS, Parameterized complexity, Springer-Verlag, New York, 1999.
10. J. ELLIS, H. FAN, AND M. FELLOWS, The dominating set problem is fixed parameter tractable for graphs of bounded genus, in The 8th Scandinavian Workshop on Algorithm Theory-SWAT 2002 (Turku, Finland), Springer, Lecture Notes in Computer Science, Berlin, vol. 2368, 2002, pp. 180-189.
11. D. EPPSTEIN, Diameter and treewidth in minor-closed graph families, Algorithmica, 27 (2000), pp. 275-291.
12. J. FLUM AND M. GROHE, Fixed-parameter tractability, definability, and modelchecking, SIAM J. Comput.
13. F. V FOMIN AND D. M. THILIKOS, Dominating Sets in Planar Graphs: BranchWidth and Exponential Speed-up, Proceedings of the Fourteenth ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 168-177.
14. M. FRICK AND M. GROHE, Deciding first-order properties of locally tree-decomposable graphs, J. ACM, 48 (2001), pp. 1184 - 1206.
15. M. GROHE, Local tree-width, excluded minors, and approximation algorithms. To appear in Combinatorica.
16. I. KANJ AND L. PERKOVIĆ, Improved parameterized algorithms for planar dominating set, in Mathematical Foundations of Computer Science-MFCS 2002, Springer, Lecture Notes in Computer Science, Berlin, vol.2420, 2002, pp. 399-410.
17. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, 7 (1986), pp. 309-322.
18. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. V. Excluding a planar graph, J. Comb. Theory Series B, 41 (1986), pp. 92-114.