Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors

Algorithmica (New York)

Volumn 41, Issue 4, 2005, Pages 245-267

  Demaine, Erik D ^a   Hajiaghayi, Mohammadtaghi ^a   Thilikos, Dimitrios M ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Dominating set; Graph minors; Subexponential algorithms

Indexed keywords

APPROXIMATION THEORY; FEEDBACK; GRAPH THEORY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

DOMINATING SET; FIXED-PARAMETER ALGORITHMS; GRAPH MINORS; SUBEXPONENTIAL ALGORITHMS;

ALGORITHMS;

EID: 13644258065     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1125-y     Document Type: Article

References (65)

1. +] Jochen Alber, Hans L. Bodlaender, Henning Fernau, Tom Kloks, and Rolf Niedermeier. Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica, 33(4):461-493, 2002.
2. +] G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer-Verlag, Berlin, 1999.
3. [ACPS] Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, and Detlef Seese. An algebraic theory of graph reduction. J. Assoc. Comput. Mach., 40(5):1134-1164, 1993.
4. [AFN] Jochen Alber, Henning Fernau, and Rolf Niedermeier. Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms, 52(1):26-56, 2004.
5. [ALS] Stefan Amborg, Jens Lagergren, and Detlef Seese. Problems easy for tree-decomposable graphs (extended abstract). In Proceedings of the 15th International Colloquium of Automata, Languages and Programming (Tampere, 1988), volume 317 of Lecture Notes in Computer Science, pages 38-51. Springer-Verlag, Berlin, 1988.
6. [Am] Eyal Amir. Efficient approximation for triangulation of minimum treewidth. In Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI-2001) (San Francisco, CA), pages 7-15. Morgan Kaufmann, San Mateo, CA, 2001.
7. [AN] Jochen Alber and Rolf Niedermeier. Improved tree decomposition based algorithms for domination-like problems. In Latin American Theoretical Informatics - LATIN 2002 (Cancun, Mexico), volume 2286 of Lecture Notes in Computer Science, pages 613-627. Springer-Verlag, Berlin, 2002.
8. [AP] Stefan Arnborg and Andrzej Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math., 23(1):11-24, 1989.
9. [As] Takao Asano. An approach to the subgraph homeomorphism problem. Theoret. Comput. Sci., 38(2-3):249-267, 1985.
10. [AST] Thomas Andreae, Martin Schughart, and Zsolt Tuza. Clique-transversal sets of line graphs and complements of line graphs. Discrete Math., 88(1):11-20, 1991.
11. [Bak] Brenda S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach., 41(1):153-180, 1994.
12. [BBHS] D. W. Bange, A. E. Barkauskas, L. H. Host, and P. J. Slater. Generalized domination and efficient domination in graphs. Discrete Math., 159(1-3):1-11, 1996.
13. [BBYG] Ann Becker, Reuven Bar-Yehuda, and Dan Geiger. Randomized algorithms for the loop cutset problem. J. Artificial Intelligence Res., 12:219-234 (electronic), 2000.
14. [BdF] Hans L. Bodlaender and Babette de Fluiter. Reduction algorithms for constructing solutions in graphs with small treewidth. In Proceedings of the 2nd Annual International Conference on Computing and Combinatorics (Hong Kong, 1996), volume 1090 of Lecture Notes in Computer Science, pages 199-208. Springer-Verlag, Berlin, 1996.
15. [BG] Jonathan F. Buss and Judy Goldsmith. Nondeterminism within P. SIAM J. Comput., 22(3):560-572, 1993.
16. [BM1] John A. Bondy and U. S. R. Murty. Graph Theory with Applications. Elsevier, New York, 1976.
17. [BM2] Hans L. Bodlaender and Rolf H. Möhring. The pathwidth and treewidth of cographs. SIAM J. Discrete Math., 6(2):181-188, 1993.
18. [BNR] V. Balachandran, P. Nagavamsi, and C. Pandu Rangan. Clique transversal and clique independence on comparability graphs. Inform. Process. Lett., 58(4):181-184, 1996.
19. [Bo1] Hans L. Bodlaender. Dynamic programming algorithms on graphs with bounded treewidth. In Proceedings of the 15th International Colloquium on Automata, Languages and Programming (Tampere, 1988), volume 317 of Lecture Notes in Computer Science, pages 105-119. Springer-Verlag, Berlin, 1988.
20. [Bo2] Hans L. Bodlaender. On disjoint cycles. In Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science (Fischbachau, 1991), volume 657 of Lecture Notes in Computer Science, pages 230-238. Springer-Verlag, Berlin, 1992.
21. [Bo3] Hans L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25(6): 1305-1317, 1996.
22. [Bo4] Hans L. Bodlaender. Treewidth: algorithmic techniques and results. In Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (Bratislava, 1997), volume 1295 of Lecture Notes in Computer Science, pages 19-36. Springer-Verlag, Berlin, 1997.
23. [Bo5] Hans L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1-2): 1-45, 1998.
24. [BvLTT] Hans L. Bodlaender, Jan van Leeuwen, Richard Tan, and Dimitrios M. Thilikos. On interval routing schemes and treewidth. Inform. and Comput., 139(1):92-109, 1997.
25. [CCCY] Maw-Shang Chang, Yi-Hua Chen, Gerard J. Chang, and Jing-Ho Yan. Algorithmic aspects of the generalized clique-transversal problem on chordal graphs. Discrete Appl. Math., 66(3): 189-203, 1996.
26. [CGH] 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.
27. [CKJ] Jianer Chen, Iyad A. Kanj, and Weijia Jia. Vertex cover: further observations and further improvements. J. Algorithms, 41(2):280-301, 2001.
28. [CKL] 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 (WG 2001, Boltenhagen, Germany), volume 2204 of Lecture Notes in Computer Science, pages 32-43. Springer-Verlag, Berlin, 2001.
29. [Co] Bruno Courcelle. Graph rewriting: an algebraic and logic approach. In Handbook of Theoretical Computer Science, Vol. B, pages 193-242. Elsevier, Amsterdam, 1990.
30. [DF] Rodney G. Downey and Michael R. Fellows. Parameterized Complexity. Springer-Verlag, New York, 1999.
31. [DFHT1] Erik D. Demaine, Fedor V. Fomin, Mohammadtaghi Hajiaghayi, and Dimitrios M. Thilikos. Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs. ACM Trans. Algorithms. To appear. A preliminary version appears in Proceedings of the 30th International Colloquium on Automata, Languages and Programming, volume 2719 of Lecture Notes in Computer Science, pages 829-844. Springer-Verlag, Berlin.
32. [DFHT1] Erik D. Demaine, Fedor V. Fomin, Mohammadtaghi Hajiaghayi, and Dimitrios M. Thilikos. Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs. ACM Trans. Algorithms. To appear. A preliminary version appears in Proceedings of the 30th International Colloquium on Automata, Languages and Programming, volume 2719 of Lecture Notes in Computer Science, pages 829-844. Springer-Verlag, Berlin.
33. [DFHT2] Erik D. Demaine, Fedor V. Fomin, Mohammadtaghi Hajiaghayi, and Dimitrios M. Thilikos. Bidimensional parameters and local treewidth. SIAM J. Discrete Math. To appear. A preliminary version appears in Proceedings of the 6th Latin American Symposium on Theoretical Informatics, Volume 2976 of Lecture Notes in Computer Science, pages 109-118. Springer-Verlag, Berlin, 2004.
34. [DFHT2] Erik D. Demaine, Fedor V. Fomin, Mohammadtaghi Hajiaghayi, and Dimitrios M. Thilikos. Bidimensional parameters and local treewidth. SIAM J. Discrete Math. To appear. A preliminary version appears in Proceedings of the 6th Latin American Symposium on Theoretical Informatics, Volume 2976 of Lecture Notes in Computer Science, pages 109-118. Springer-Verlag, Berlin, 2004.
35. [DFHT3] Erik D. Demaine, Fedor V. Fomin, Mohammadtaghi Hajiaghayi, and Dimitrios 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 '04), pages 823-832, January 2004.
36. [DH1] Erik D. Demaine and Mohammad 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 '04), pages 833-842, January 2004.
37. [DH2] Erik D. Demaine and Mohammadtaghi Hajiaghayi. Diameter and treewidth in minor-closed graph families, revisited. Algorithmica, 40(3):211-215, 2004.
38. +] Erik D. Demaine, Mohammadtaghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. System Sci., 69(2): 166-195, September 2004.
39. [DHT1] Erik D. Demaine, Mohammadtaghi Hajiaghayi, and Dimitrios M. Thilikos. A 1.5-approximation for treewidth of graphs excluding a graph with one crossing. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2002), volume 2462 of Lecture Notes in Computer Science, pages 67-80. Springer-Verlag, Berlin, 2002.
40. [DHT2] Erik D. Demaine, Mohammadtaghi Hajiaghayi, and Dimitrios M. Thilikos. The bidimensional theory of bounded-genus graphs. In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS 2004) (Prague) pages 191-203, August 2004.
41. [Di1] Reinhard Diestel. Simplicial decompositions of graphs: a survey of applications. Discrete Math., 75(1-3):121-144, 1989.
42. [Di2] Reinhard Diestel. Decomposing infinite graphs. Discrete Math., 95(1-3):69-89, 1991.
43. [DS] Irit Dinur and Shmuel Safra. The importance of being biased. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (Montréal, 2002), pages 33-42, 2002.
44. [Ep] David Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27(3-4):275-291, 2000.
45. in ≤ 2 are NP-complete. Discrete Appl. Math., 3(4):257-262, 1981.
46. [FT1] Fedor V. Fomin and Dimitiros M. Thilikos. New upper bounds on the decomposability of planar graphs and fixed parameter algorithms. Technical report, Universitat Politècnica de Catalunya, Spain, 2002.
47. [FT2] Fedor V. Fomin and Dimitiros M. Thilikos. Dominating sets in planar graphs: branch-width and exponential speed-up. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 168-177, 2003.
48. [GJ] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, CA, 1979.
49. [GKL] Gregory Gutin, Ton Kloks, and C. M. Lee. Kernels in planar digraphs. In Optimization Online. Mathematical Programming Society, Philadelphia, PA, 2001.
50. [GR] Venkatesan Guruswami and C. Pandu Rangan. Algorithmic aspects of clique-transversal and clique-independent sets. Discrete Appl. Math., 100(3): 183-202, 2000.
51. [Gr] Martin Grohe. Local tree-width, excluded minors, and approximation algorithms. Combinatorica, 23(4):613-332, 2003.
52. [Ha] Mohammadtaghi Hajiaghayi. Algorithms for Graphs of (Locally) Bounded Treewidth. Master's thesis, University of Waterloo, September 2001.
53. [HHS] Teresa W. Haynes, Stephen T. Hedetniemi, and Peter J. Slater. Fundamentals of Domination in Graphs. Marcel Dekker, New York, 1998.
54. 5-minor-free graphs. In Proceedings of the Euroconference on Combinatorics, Graph Theory and Applications (Barcelona, 2001), pages 158-163, 2001.
55. [KC] Ton Kloks and Leizhen Cai. Parameterized tractability of some (efficient) Y-domination variants for planar graphs and t-degenerate graphs. In Proceedings of the International Computer Symposium (ICS 2000) (Taiwan), 2000.
56. [KLL] Ton Kloks, C. M. Lee, and Jim Liu. New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs. In Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002), volume 2573 of Lecture Notes in Computer Science, pages 282-295. Springer-Verlag, Berlin, 2002.
57. 5 minor. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (Orlando, 1992), pages 345-356, 1992.
58. [KP] Iyad Kanj and Ljubomir Perković. Improved parameterized algorithms for planar dominating set. In Proceedings of the 21th International Symposium on Mathematical Foundations of Computer Science, volume 2420 of Lecture Notes in Computer Science, pages 399-410. Springer-Verlag, Berlin, 2002.
59. [RS1] Neil Robertson and Paul D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms, 7(3):309-322, 1986.
60. [RS2] Neil Robertson and Paul Seymour. Excluding a graph with one crossing. In Graph Structure Theory (Seattle, 1991), pages 669-675. American Mathematical Society, Providence, RI, 1993.
61. [Th] Andrew Thomason. The extremal function for complete minors. J. Combin. Theory Ser. B, 81(2):318-338, 2001.
62. [TP1] Jan A. Telle and Andrzej Proskurowski. Practical algorithms on partial k-trees with an application to domination-like problems. In Proceedings of 3rd Workshop on Algorithms and Data Structures (Montréal, 1993), volume 709 of Lecture Notes in Computer Science, pages 610-621. Springer-Verlag, Berlin, 1993.
63. [TP2] Jan Arne Telle and Andrzej Proskurowski. Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math., 10(4):529-550, 1997.
64. [Ue] Ryuhe Uehara. NP-complete problems on a 3-connected cubic planar graph and their applications. Technical Report TWCU-M-0004, Tokyo Woman's Christian University, 1996.
65. [Wa] Kehrer Wagner. Über eine Eigenschaft der eben Komplexe. Deutsche Math., 2:280-285, 1937.