Exponential speedup of fixed-parameter algorithms on K3 3-minor-free or K5-minor-free graphs

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

Volumn 2518 LNCS, Issue , 2002, Pages 262-273

  Demaine, Erik D ^a   Hajiaghayi, Mohammad Taghi ^a   Thilikos, Dimitrios M ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE DOMINATING SET; EXPONENTIAL FACTORS; FEEDBACK VERTEX SET; FIXED-PARAMETER ALGORITHMS; INDEPENDENT SET; SET PROBLEMS; VERTEX COVER; VERTEX REMOVAL; DOMINATING SET PROBLEMS; PLANAR GRAPH;

ALGORITHMS; GRAPH THEORY; GRAPHIC METHODS;

PARAMETER ESTIMATION;

EID: 84878663787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_24     Document Type: Conference Paper

References (28)

1. Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, and Rolf Nieder-meier. Fixed parameter algorithms for planar dominating set and related problems. Algorithmica, 33(4):461-493, 2002.
2. Jochen Alber, Henning Fernau, and Rolf Niedermeier. Parameterized complexity: Exponential speed-up for planar graph problems. In Electronic Colloquium on Computational Complexity (ECCC). Germany, 2001.
3. Jochen Alber and Rolf Niedermeier. Improved tree decomposition algorithms for domination like problems. In Latin American Theoretical Informatics, pages 613-627. Lecture Notes in Computer Science, volume 2286, 2002.
4. Takao Asano. An approach to the subgraph homeomorphism problem. Theoret. Comput. Sci., 38(2-3):249-267, 1985.
5. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and approximation. Springer-Verlag, Berlin, 1999.
6. Brenda S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach., 41(1):153-180, 1994.
7. Hans L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1-2):1-45, 1998. (Pubitemid 128450429)
8. John A. Bondy and U. S. R. Murty. Graph Theory with Applications. American Elsevier Publishing Co., Inc., New York, 1976.
9. Maw-Shang Chang, Ton Kloks, and Chuan-Min Lee. Maximum clique transversals. In Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 300-310. Boltenhagen, Germany, 2001.
10. Ernest J. Cockayne, Sue Goodman, and Stephen Hedetniemi. A linear time algorithm for the domination number of a tree. Inform. Process. Lett., 4(1):41-44, 1975.
11. Erik D. Demaine, Mohammadtaghi Hajiaghayi, and Dimitrios M. Thilikos. 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, 2002, to appear.
12. 5-minor-free graphs. Technical Report MIT-LCS-TR-838, Mass. Inst. Technology, March 2002.
13. Reinhard Diestel. Simplicial decompositions of graphs: a survey of applications. Discrete Math., 75(1-3):121-144, 1989.
14. Rodney G. Downey and Michael R. Fellows. Parameterized Complexity. Springer-Verlag, New York, 1999.
15. David Eppstein. Diameter and treewidth in minor-closed graph families. Algorith-mica, 27(3-4):275-291, 2000.
16. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Co., 1979.
17. Gregory Gutin, Ton Kloks, and C. M. Lee. Kernels in planar digraphs. In Optimization Online. Mathematical Programming Society, Philadelphia, 2001.
18. 5-minor-free graphs. In Euroconf. on Combinatorics, Graph Theory and Applications, 2001.
19. Teresa W. Haynes, Stephen T. Hedetniemi, and Peter J. Slater. Fundamentals of domination in graphs. Marcel Dekker Inc., New York, 1998.
20. Iyad A. Kanj and Ljubomir Perković. Improved parameterized algorithms for planar dominating set. In 27th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science 2002.
21. 5 minor. In Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms (Orlando, FL, 1992), pages 345-356, 1992.
22. 3,3-free graphs. Inform. and Comput., 84(1):13-25, 1990. (Pubitemid 20637267)
23. Ton Kloks and Leizhen Cai. Parameterized tractability of some (efficient) Y-domination variants for planar graphs and t-degenerate graphs. In International Computer Symposium (ICS). Taiwan, 2000.
24. Ton Kloks, C.M. Lee, and Jim Liu. Feedback vertex sets and disjoint cycles in planar (di)graphs. In Optimization Online. Math. Prog. Soc., Philadelphia, 2001.
25. Neil Robertson and Paul Seymour. Excluding a graph with one crossing. In Graph structure theory (Seattle), pages 669-675. Amer. Math. Soc., 1993.
26. Jan A. Telle and Andrzej Proskurowski. Practical algorithms on partial k-trees with an application to domination-like problems. In Proceedings of Third Workshop on Algorithms and Data Structures (Montréal, 1993), pages 610-621.
27. 3,3-free graphs and related problems. Inform. and Comput., 80(2):152-164, 1989.
28. Kehrer Wagner. Über eine Eigenschaft der eben Komplexe. Deutsche Math., 2:280-285, 1937.