Approximation algorithms for classes of graphs excluding single-crossing graphs as minors

Journal of Computer and System Sciences

Volumn 69, Issue 2, 2004, Pages 166-195

  Demaine, Erik D ^a   Hajiaghayi, MohammadTaghi ^a   Nishimura, Naomi ^b   Ragde, Prabhakar ^b   Thilikos, Dimitrios M ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECOMPOSITION; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

BRANCHWIDTH; POLYNOMIAL TIME CONSTRUCTIONS; SINGLE-CROSSING-MINOR GRAPHS; TREEWIDTH;

GRAPH THEORY;

EID: 3342990953     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2003.12.001     Document Type: Article

References (68)

1. Alber J., Bodlaender H.L., Fernau H., Kloks T., Niedermeier R. Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica. 33:2002;461-493.
2. J. Alber, H. Fan, M.R. Fellows, H. Fernau, R. Niedermeier, F.A. Rosamond, U. Stege, Refined search tree technique for dominating set on planar graphs, in: Proceedings of 26th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 2136, Springer, Berlin, 2001, pp. 111-122.
3. J. Alber, H. Fernau, R. Niedermeier, Parameterized complexity: exponential speed-up for planar graph problems, in: Proceedings of the 28th Annual International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 261-272.
4. J. Alber, R. Niedermeier, Improved tree decomposition-based algorithms for domination-like problems, in: Proceedings of LATIN 2002, Fifth Latin American Symposium on Theoretical Informatics, Lecture Notes in Computer Science, Vol. 2286, Springer, Berlin, 2002, pp. 613-628.
5. N. Alon, P. Seymour, R. Thomas, A separator theorem for graphs with excluded minor and its applications, in: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990, pp. 293-299.
6. E. Amir, Efficient approximation for triangulation of minimum treewidth, in: Proceedings of the 17th Annual Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, Los Altos, CA, 2001, pp. 7-15.
7. Arnborg S., Corneil D.G., Proskurowski A. Complexity of finding embeddings in a. k -tree SIAM J. Algebraic Discrete Methods. 8(2):1987;277-284.
8. Arnborg S., Proskurowski A. Characterization and recognition of partial 3-trees. SIAM J. Algebraic Discrete Methods. 7(2):1986;305-314.
9. Asano T. An approach to the subgraph homeomorphism problem. Theoret. Comput. Sci. 38(2-3):1985;249-267.
10. Baker B.S. Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach. 41(1):1994;153-180.
11. H.L. Bodlaender, Dynamic programming algorithms on graphs with bounded treewidth, in: Proceedings of the 15th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 317, 1988, pp. 105-118.
12. Bodlaender H.L. A tourist guide through treewidth. Acta Cybernet. 11:1993;1-23.
13. Bodlaender H.L. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6):1996;1305-1317.
14. H.L. Bodlaender, Treewidth: algorithmic techniques and results, in: Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science, 1997, pp. 29-36.
15. Bodlaender H.L. A partial. k -arboretum of graphs of bounded treewidth Theoret. Comput. Sci. 209:1998;1-45.
16. Bodlaender H.L., Gilbert J.R., Hafsteinsson H., Kloks T. Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. J. Algorithms. 18(2):1995;238-255.
17. Bodlaender H.L., Kloks T., Kratsch D. Treewidth and pathwidth of permutation graphs. SIAM J. Discrete Math. 8(4):1995;606-616.
18. Bodlaender H.L., Kloks T. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms. 21(2):1996;358-402.
19. Bodlaender H.L., Möhring R.H. The pathwidth and treewidth of cographs. SIAM J. Discrete Math. 6(2):1993;181-188.
20. Bodlaender H.L., Thilikos D.M. Treewidth for graphs with small chordality. Discrete Appl. Math. 79(1-3):1997;45-61.
21. Bodlaender H.L., van Leeuwen J., Tan R., Thilikos D. On interval routing schemes and treewidth. Inform. and Comput. 139(1):1997;92-109.
22. Bondy J.A., Murty U.S.R. Graph Theory with Applications. 1976;American Elsevier Publishing Co., Inc. New York.
23. V. Bouchitté, D. Kratsch, H. Müller, I. Todinca, On treewidth approximations, in: Proceedings of the First Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Electronic Notes in Discrete Mathematics, Vol. 8, 2001.
24. Bouchitté V., Todinca I. Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput. 31(1):2001;212-232.
25. Broersma H.J., Dahlhaus E., Kloks T. A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. Discrete Appl. Math. 99(1-3):2000;367-400.
26. Bui T.N., Peck A. Partitioning planar graphs. SIAM J. Comput. 21(2):1992;203-215.
27. M.-S. Chang, T. Kloks, C.-M. Lee, Maximum clique transversals, in: Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, 2001, pp. 300-310.
28. Chen J., Kanj I.A., Jia W. Vertex cover. further observations and further improvements J. Algorithms. 41(2):2001;280-301.
29. 5 -free graphs J. Algorithms. 26(1):1998;166-187.
30. Chiba N., Nishizeki T., Saito N. An approximation algorithm for the maximum independent set problem on planar graphs. SIAM J. Comput. 11(4):1982;663-675.
31. 5 -minor-free graphs, in: Proceedings of the 13th Annual Symposium on Algorithms and Computation, 2002, pp. 262-273.
32. Díaz J., Serna M.J., Torán J. Parallel approximation schemes for problems on planar graphs. Acta Inform. 33(4):1996;387-408.
33. Diestel R. Simplicial decompositions of graphs: a survey of applications. Discrete Math. 75(1-3):1989;121-144.
34. Diestel R. Decomposing infinite graphs. Discrete Math. 95:1991;69-89.
35. Downey R.G., Fellows M.R. Parameterized Complexity. 1999;Springer, New York.
36. J. Ellis, H. Fan, M.R. Fellows, The dominating set problem is fixed parameter tractable for graphs of bounded genus, in: Proceedings of the Eighth Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 2368, Springer, Berlin, 2002, pp. 180-189.
37. Eppstein D. Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3(3):1999;1-27.
38. Eppstein D. Diameter and treewidth in minor-closed graph families. Algorithmica. 27(3-4):2000;275-291.
39. Frick M., Grohe M. Deciding first-order properties of locally tree-decomposable structures. J. ACM. 48(6):2001;1184-1206.
40. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness. 1979;W. H. Freeman and Co. San Francisco, CA.
41. M. Grohe, Local tree-width, excluded minors, and approximation algorithms, Combinatorica, 2001, to appear.
42. Habib M., Möhring R.H. Treewidth of cocomparability graphs and a new order-theoretic parameter. Order. 11:1994;47-60.
43. Hopcroft J.E., Tarjan R.E. Dividing a graph into triconnected components. SIAM J. Comput. 2:1973;135-158.
44. Kanevsky A., Ramachandran V. Improved algorithms for graph four-connectivity. J. Comput. System Sci. 42(3):1991;288-306.
45. 5 minor, in: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 345-356.
46. Kloks T. Treewidth of circle graphs. Internat. J. Found. Comput. Sci. 7(2):1996;111-120.
47. T. Kloks, C.M. Lee, J. Liu, Feedback vertex sets and disjoint cycles in planar (di)graphs, Optimization Online, 2001.
48. Lagergren J. Efficient parallel algorithms for graphs of bounded tree-width. J. Algorithms. 20(1):1996;20-44.
49. Lipton R.J., Tarjan R.E. Applications of a planar separator theorem. SIAM J. Comput. 9(3):1980;615-627.
50. Matoušek J., Thomas R. On the complexity of finding iso- and other morphisms for partial. k -trees Discrete Math. 108(1-3):1992;343-364.
51. Miller G.L., Ramachandran V. A new graph triconnectivity algorithm and its parallelization. Combinatorica. 12(1):1992;53-76.
52. Robertson N., Seymour P.D. Graph minors. III, Planar tree-width. J. Combin. Theory Ser. B. 36:1984;49-64.
53. Robertson N., Seymour P.D. Graph minors - a survey. Anderson I. Surveys in Combinatorics. 1985;153-171 Cambridge University Press, Cambridge.
54. Robertson N., Seymour P.D. Graph minors. II, Algorithmic aspects of tree-width. J. Algorithms. 7(3):1986;309-322.
55. Robertson N., Seymour P.D. Graph minors. X, Obstructions to tree-decomposition. J. Combin. Theory Ser. B. 52:1991;153-190.
56. N. Robertson, P. Seymour, Excluding a graph with one crossing, in: Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, Graph Structure Theory, 1993, pp. 669-675.
57. Rose D.J. On simple characterizations of. k -trees Discrete Math. 7:1974;317-322.
58. Sanders D.P. On linear recognition of tree-width at most four. SIAM J. Discrete Math. 9(1):1996;101-117.
59. Seymour P.D., Thomas R. Call routing and the ratcatcher. Combinatorica. 14(2):1994;217-241.
60. Sundaram R., Singh K.S., Rangan P.C. Treewidth of circular-arc graphs. SIAM J. Discrete Math. 7(4):1994;647-655.
61. Tarjan R. Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2):1972;146-160.
62. J.A. Telle, A. Proskurowski, Practical algorithms on partial k -trees with an application to domination-like problems, in: Proceedings of Third Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 709, 1993, pp. 610-621.
63. Telle J.A., Proskurowski A. Algorithms for vertex partitioning problems on partial. k -trees SIAM J. Discrete Math. 10(4):1997;529-550.
64. Thomason A. The extremal function for complete minors. J. Combin. Theory, Ser. B. 81(2):2001;318-338.
65. J. van Leeuwen, Graph algorithms, in: Handbook of Theoretical Computer Science, Vol. A, Elsevier, Amsterdam, 1990, pp. 525-631 (Chapter 10).
66. Wagner K. Über eine Eigenschaft der ebenen Komplexe. Math. Ann. 114:1937;570-590.
67. Williamson S.G. Depth-first search and Kuratowski subgraphs. J. Assoc. Comput. Mach. 31(4):1984;681-693.
68. M. Yannakakis, Node- and edge-deletion NP-complete problems, in: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, 1978, pp. 253-264.