Bidimensional parameters and local treewidth

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 3, 2004, Pages 501-511

  Demaine, Erik D ^a   Fomin, Fedor V ^b   Hajiaghayi, Mohammadtaghi ^a   Thilikos, Dimitrios M ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF BERGEN   (Norway)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Dominating set; Graph minors; Local treewidth; Treewidth

Indexed keywords

BIDIMENSIONAL PARAMETERS; DOMINATING SET; GRAPH MINORS; LOCAL TREEWIDTH; TREEWIDTH;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; SET THEORY; TREES (MATHEMATICS);

GRAPH THEORY;

EID: 20744459687     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103433410     Document Type: Article

References (32)

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. R. FELLOWS, H. FERNAU, R. NIEDERMEIER, F. A. ROSAMOND, AND U. STEGE, Refined search tree technique for dominating set on planar graphs, in Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS 2001), Lecture Notes in Comput. Sci. 2136, Springer, Berlin, 2001, pp. 111-122.
3. J. ALBER, M. R. FELLOWS, AND R. NIEDERMEIER, Polynomial-time data reduction for dominating set, J. ACM, 51 (2004), pp. 363-384.
4. J. ALBER, H. FERNAU, AND R. NIEDERMEIER, Parameterized complexity: Exponential speed-up for planar graph problems, J. Algorithms, 52 (2004), pp. 26-56.
5. E. AMIR, Efficient approximation for triangulation of minimum treewidth, in Uncertainty in Artificial Intelligence: Proceedings of the 17th Conference (UAI-2001), Morgan Kaufmann Publishers, 2001, pp. 7-15.
6. B. S. BAKER, Approximation algorithms for NP-complete problems on planar graphs, J. ACM, 41 (1994), pp. 153-180.
7. H. L. BODLAENDER, A tourist guide through treewidth, Acta Cybernet., 11 (1993), pp. 1-23.
8. M. S. CHANG, T. KLOKS, AND C. M. LEE, Maximum clique transversals, in Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Comput. Sci. 2204, Springer, Berlin, 2001, pp. 300-310.
9. J. CHEN, I. A. KANJ, AND W. JIA, Vertex cover: Further observations and further improvements, J. Algorithms, 41 (2001), pp. 280-301.
10. B. COURCELLE, Graph rewriting: An algebraic and logic approach, in Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam, 1990, pp. 193-242.
11. E. D. DEMAINE, F. V. FOMIN, M. T. HAJIAGHAYI, AND D. M. THILIKOS, Bidimensional parameters and local treewidth, in Proceedings of the 6th Latin American Theoretical Informatics Symposium (LATIN 2004), Lecture Notes in Comput. Sci. 2976, Springer, Berlin, 2004, pp. 109-118.
12. E. D. DEMAINE, F. V. FOMIN, M. T. HAJIAGHAYI, AND D. M. THILIKOS, Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs, in Proceedings of the 30th International Colloquium on Automata, Languages, and Programming (ICALP 2003), Lecture Notes in Comput. Sci. 2719, Springer, Berlin, 2003, pp. 829-844.
13. E. D. DEMAINE, F. V. FOMIN, M. T. HAJIAGHAYI, AND D. M. THILIKOS, Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs, in Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), New Orleans, LA, 2004, pp. 823-832.
14. E. D. DEMAINE AND M. T. HAJIAGHAYI, Equivalence of local treewidth and linear local treewidth and its algorithmic applications, in Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), New Orleans, LA, 2004, pp. 833-842.
15. 5-minor-free graphs, in Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC 2002), Lecture Notes in Comput. Sci. 2518, Springer, Berlin, 2002, pp. 262-273.
16. E. D. DEMAINE, M. T. HAJIAGHAYI, AND D. M. THILIKOS, The bidimensional theory of bounded-genus graphs, in Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS 2004), Lecture Notes in Comput. Sci. 3153, Springer, Berlin, 2004, pp. 191-203.
17. R. DIESTEL, Graph Theory, Springer-Verlag, New York, 2000.
18. 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.
19. R. G. DOWNEY AND M. R. FELLOWS, Parameterized Complexity, Springer-Verlag, New York, 1999.
20. J. ELLIS, H. FAN, AND M. FELLOWS, The dominating set problem is fixed parameter tractable for graphs of bounded genus, in Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT 2002), Lecture Notes in Comput. Sci. 2368, Springer, Berlin, 2002, pp. 180-189.
21. D. EPPSTEIN, Diameter and treewidth in minor-closed graph families, Algorithmica, 27 (2000), pp. 275-291.
22. J. FLUM AND M. GROHE, Fixed-parameter tractability, definability, and model-checking, SIAM J. Comput. 31 (2001), pp. 113-145.
23. F. V. FOMIN AND D. M. THILIKOS, Dominating sets in planar graphs: Branch-width and exponential speed-up, in Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), Baltimore, MD, 2003, pp. 168-177.
24. F. V. FOMIN AND D. M. THILIKOS, Dominating sets and local treewidth, in Proceedings of the 11th European Symposium on Algorithms (ESA 2003), Lecture Notes in Comput. Sci. 2832, Springer, Berlin, 2003, pp. 221-229.
25. F. V. FOMIN AND D. M. THILIKOS, A simple and fast approach for solving problems on planar graphs, in Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science (STACS 2004), Lecture Notes in Comput. Sci. 2996, Springer, Berlin, 2004, pp. 56-67.
26. F. V. FOMIN AND D. M. THILIKOS, Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up, in Proceedings of the 31th International Colloquium on Automata, Languages, and Programming (ICALP 2004), Lecture Notes in Comput. Sci. 3142, Springer, Berlin, pp. 581-592.
27. M. FRICK AND M. GROHE, Deciding first-order properties of locally tree-decomposable graphs, J. ACM, 48 (2001), pp. 1184-1206.
28. H. GAIFMAN, On local and nonlocal properties, in Proceedings of the Herbrand Symposium (Marseilles, 1981), North-Holland, Amsterdam, 1982, pp. 105-135.
29. M. GROHE, Local tree-width, excluded minors, and approximation algorithms, Combinatorica, 23 (2003), pp. 613-632.
30. I. KANJ AND L. PERKOVIĆ, Improved parameterized algorithms for planar dominating set, in Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002), Lecture Notes in Comput. Sci. 2420, Springer, Berlin, 2002, pp. 399-410.
31. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, 7 (1986), pp. 309-322.
32. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. V. Excluding a planar graph, J. Combin. Theory Ser. B, 41 (1986), pp. 92-114.