Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up

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

Volumn 3142, Issue , 2004, Pages 581-592

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

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Branch width; Dominating set; Parameterized algorithms; Subexponential algorithms; embedded graphs

Indexed keywords

ALGORITHMS; GRAPHIC METHODS; PARAMETER ESTIMATION; PARAMETERIZATION; PROBLEM SOLVING; TOPOLOGY;

BRANCH-WIDTH; DOMINATING SETS; EMBEDDED GRAPHS; PARAMETERIZED ALGORITHM; SUB-EXPONENTIAL ALGORITHMS;

GRAPH THEORY;

EID: 35048831453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_50     Document Type: Article

References (19)

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, M. R. FELLOWS, AND R. NIEDERMEIER, Efficient data reduction for dominating set: A linear problem kernel for the planar case, in SWAT 2002, Springer, vol. 2368, Berlin, 2002, pp. 150-159. To appear in the Journal of the ACM.
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. E. D. DEMAINE, F. V. FOMIN, M. HAJIAGHAYI, AND D. M. THILIKOS, Fixed-parameter algorithms for the (k,r)-center in planar graphs and map graphs, in The 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), vol. 2719, 2003, pp. 829-844.
5. _, Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs, in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 823-832. to appear.
6. E. D. DEMAINE AND M. HAJIAGHAYI, Equivalence of local treemdth and linear local treewidth and its algorithmic applications, in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004. to appear.
7. 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.
8. H. N. DJIDJEV AND S. M. VENKATESAN, Planarization of graphs embedded on surfaces, in WG, vol. 1017 of Lecture Notes in Comput. Sci., Springer, Berlin, 1995, pp. 62-72.
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. F. V. FOMIN AND D. M. THILIKOS, Dominating sets in planar graphs: Branchwidth and exponential speed-up, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003, pp. 168-177.
12. _, New upper bounds on the decomposability of planar graphs and fixed parameter algorithms, Technical Report 240, Department of Informatics, University of Bergen, Norway, 2003.
13. Extended abstract A Simple and Fast Approach for Solving Problems on Planar Graphs to appear in the proceedings of STACS 2004.
14. 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.
15. T. KLOKS, C. M. LEE, AND J. LIU, New algorithms for k-face, cover, k-feedback vertex set, and k-disjoint set on plane and planar graphs, in The 28th International Workshop on Graph-Theoretic Concepts in Computer Science(WG 2002), Springer, Lecture Notes in Computer Science, Berlin, vol. 2573, 2002, pp. 282-296.
16. B. MOHAR AND C. THOMASSEN, Graphs on surfaces, Johns Hopkins Studies in the Mathematical Sciences, Johns Hopkins University Press, Baltimore, MD, 2001.
17. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. VII. Disjoint paths on a surface, J. Combin. Theory Ser. B, 45 (1988), pp. 212-254.
18. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. X. Obstructions to tree-decomposition, Journal of Combinatorial Theory Series B, 52 (1991), pp. 153-190.
19. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. XI. Circuits on a surface, J. Combin. Theory Ser. B, 60 (1994), pp. 72-106.