Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction

Algorithmica (New York)

Volumn 54, Issue 2, 2009, Pages 142-180

  Demaine, Erik D ^a   Hajiaghayi, MohammadTaghi ^a,b   Kawarabayashi, Ken Ichi ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Carnegie Mellon University   (United States)

^c NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Bidimensionality; Graph algorithms; Graph minors; Grid graphs; Treewidth; Wagner's conjecture

Indexed keywords

BIDIMENSIONALITY; GRAPH ALGORITHMS; GRAPH MINORS; GRID GRAPHS; TREEWIDTH; WAGNER'S CONJECTURE;

ALGORITHMS; METAL RECOVERY; SHRINKAGE;

GRAPH THEORY;

EID: 67349222145     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9138-y     Document Type: Conference Paper

References (59)

1. J. Alber H.L. Bodlaender H. Fernau T. Kloks R. Niedermeier 2002 Fixed parameter algorithms for dominating set and related problems on planar graphs Algorithmica 33 4 461 493
2. J. Alber H. Fernau R. Niedermeier 2004 Parameterized complexity: exponential speed-up for planar graph problems J. Algorithms 52 1 26 56
3. a,k minors in graphs of bounded tree-width J. Comb. Theory Ser. B 86 1 133 147
4. Böhme, T., Kawarabayashi, K., Maharry, J., Mohar, B.: Linear connectivity forces large complete bipartite minors. Manuscript (October 2004). http://www.dais.is.tohoku.ac.jp/~k-keniti/KakNew8.ps
5. 3,k -minors in large 7-connected graphs. Manuscript (December 2006). http://www.dais.is.tohoku.ac.jp/~k-keniti/k3k.ps
6. Bouchitté, V., Mazoit, F., Todinca, I.: Treewidth of planar graphs: connections with duality. In: Proceedings of the Euroconference on Combinatorics, Graph Theory and Applications, Barcelona, 2001
7. Chang, M.-S., Kloks, T., Lee, C.-M.: Maximum clique transversals. In: Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001). Lecture Notes in Computer Science, vol. 2204, pp. 32-43 (2001)
8. 3,t -minors. Submitted manuscript. http://www.math.gatech.edu/ ~yu/Papers/k3t2-10.pdf
9. J. Chen I.A. Kanj W. Jia 2001 Vertex cover: further observations and further improvements J. Algorithms 41 2 280 301 (Pubitemid 33665542)
10. Z.-Z. Chen 2001 Approximation algorithms for independent sets in map graphs J. Algorithms 41 1 20 40 (Pubitemid 33667214)
11. Z.-Z. Chen M. Grigni C.H. Papadimitriou 2002 Map graphs J. ACM 49 2 127 138 (Pubitemid 44159316)
12. Demaine, E.D., Hajiaghayi, M.: 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), pp. 833-842 (January 2004)
13. Demaine, E.D., Hajiaghayi, M.: Fast algorithms for hard graph problems: Bidimensionality, minors, and local treewidth. In: Proceedings of the 12th International Symposium on Graph Drawing, Harlem, NY, 2004. Lecture Notes in Computer Science, vol. 3383, pp. 517-533 (2004)
14. Demaine, E.D., Hajiaghayi, M.: Bidimensionality: new connections between FPT algorithms and PTASs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, January 2005, pp. 590-601 (2005)
15. Demaine, E.D., Hajiaghayi, M.: Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, January 2005, pp. 682-689 (2005)
16. E.D. Demaine M. Hajiaghayi 2007 Quickly deciding minor-closed parameters in general graphs Eur. J. Comb. 28 1 311 314
17. Demaine, E.D., Hajiaghayi, M., Thilikos, D.M.: 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, Italy, APPROX 2002. Lecture Notes in Computer Science, vol. 2462, pp. 67-80 (2002)
18. E.D. Demaine F.V. Fomin M. Hajiaghayi D.M. Thilikos 2004 Bidimensional parameters and local treewidth SIAM J. Discrete Math. 18 3 501 511
19. E.D. Demaine M. Hajiaghayi N. Nishimura P. Ragde D.M. Thilikos 2004 Approximation algorithms for classes of graphs excluding single-crossing graphs as minors J. Comput. Syst. Sci. 69 2 166 195
20. E.D. Demaine F.V. Fomin M. Hajiaghayi D.M. Thilikos 2005 Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs ACM Trans. Algorithms 1 1 33 47
21. E.D. Demaine F.V. Fomin M. Hajiaghayi D.M. Thilikos 2005 Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs J. ACM 52 6 866 893 (Pubitemid 43906506)
22. Demaine, E.D., Hajiaghayi, M., Kawarabayashi, K.: Algorithmic graph minor theory: decomposition, approximation, and coloring. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA, October 2005, pp. 637-646 (2005)
23. E.D. Demaine M. Hajiaghayi D.M. Thilikos 2005 Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors Algorithmica 41 4 245 267
24. E.D. Demaine M. Hajiaghayi D.M. Thilikos 2006 The bidimensional theory of bounded-genus graphs SIAM J. Discrete Math. 20 2 357 371 (Pubitemid 46785429)
25. 6-minors in large 6-connected graphs. Preprint
26. Diestel, R.: Graph Theory, 2nd edn. Graduate Texts in Mathematics, vol. 173. Springer, New York (2000)
27. R. Diestel T.R. Jensen K.Y. Gorbunov C. Thomassen 1999 Highly connected sets and the excluded grid theorem J. Comb. Theory Ser. B 75 1 61 73
28. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
29. D. Eppstein 1993 Connectivity, graph minors, and subgraph multiplicity J. Graph Theory 17 3 409 416
30. D. Eppstein 2000 Diameter and treewidth in minor-closed graph families Algorithmica 27 3-4 275 291
31. M.R. Fellows M.A. Langston 1988 Nonconstructive tools for proving polynomial-time decidability J. ACM 35 3 727 739 (Pubitemid 18648615)
32. F.V. Fomin D.M. Thilikos 2006 Dominating sets in planar graphs: branch-width and exponential speed-up SIAM J. Comput. 36 2 281 309 (Pubitemid 46627289)
33. G. Gutin T. Kloks C.M. Lee A. Yao 2005 Kernels in planar digraphs J. Comput. Syst. Sci. 71 2 174 184
34. G. Higman 1952 Ordering by divisibility in abstract algebras Proc. Lond. Math. Soc. (3) 2 326 336
35. Hochbaum, D.S., Shmoys, D.B.: Powers of graphs: a powerful approximation technique for bottleneck problems. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pp. 324-333 (1984)
36. D.S. Johnson 1987 The NP-completeness column: an ongoing guide (column 19) J. Algorithms 8 3 438 448
37. Kanj, I., Perković, L.: 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 Computer Science, vol. 2420, pp. 399-410 (2002)
38. Kloks, T., Lee, C.M., Liu, J.: New algorithms for k-face cover, k-feedback vertex set, and k-disjoint set on plane and planar graphs. In: Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 2573, pp. 282-295 (2002)
39. Lapoire, D.: Treewidth and duality in planar hypergraphs. http://www.labri.fr/Perso/~lapoire/papers/dual-planar-treewidth.ps
40. Lau, L.C.: Bipartite roots of graphs. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 952-961 (2004)
41. N. Nishimura P. Ragde D.M. Thilikos 2002 On graph powers for leaf-labeled trees J. Algorithms 42 1 69 108
42. B. Oporowski J. Oxley R. Thomas 1993 Typical subgraphs of 3- and 4-connected graphs J. Comb. Theory Ser. B 57 2 239 257
43. Reed, B.A.: Tree width and tangles: a new connectivity measure and some applications. In: Surveys in Combinatorics, 1997 (London). London Math. Soc. Lecture Note Ser., vol. 241, pp. 87-162. Cambridge Univ. Press, Cambridge (1997)
44. Reingold, O.: Undirected st-connectivity in log-space. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 376-385 (2005)
45. N. Robertson P.D. Seymour 1986 Graph minors. II. Algorithmic aspects of tree-width J. Algorithms 7 3 309 322
46. N. Robertson P.D. Seymour 1986 Graph minors. V. Excluding a planar graph J. Comb. Theory Ser. B 41 92 114
47. N. Robertson P.D. Seymour 1986 Graph minors. II. Algorithmic aspects of tree-width J. Algorithms 7 3 309 322
48. N. Robertson P.D. Seymour 1990 Graph minors. IX. Disjoint crossed paths J. Comb. Theory Ser. B 49 1 40 77
49. N. Robertson P.D. Seymour 1991 Graph minors. X. Obstructions to tree-decomposition J. Comb. Theory Ser. B 52 153 190
50. Robertson, N., Seymour, P.: Excluding a graph with one crossing. In: Graph Structure Theory, Seattle, 1991, pp. 669-675. Am. Math. Soc., Providence (1993)
51. N. Robertson P.D. Seymour 1994 Graph minors. XI. Circuits on a surface J. Comb. Theory Ser. B 60 1 72 106
52. N. Robertson P.D. Seymour 1995 Graph minors. XII. Distance on a surface J. Comb. Theory Ser. B 64 2 240 272
53. N. Robertson P.D. Seymour 2004 Graph minors. XX. Wagner's conjecture J. Comb. Theory Ser. B 92 2 325 357 (Pubitemid 39546548)
54. N. Robertson P.D. Seymour R. Thomas 1994 Quickly excluding a planar graph J. Comb. Theory Ser. B 62 2 323 348
55. Robertson, N., Seymour, P.D., Thomas, R.: Non-planar extensions of planar graphs. Preprint (2001). http://www.math.gatech.edu/~thomas/ext.ps
56. P.D. Seymour R. Thomas 1994 Call routing and the ratcatcher Combinatorica 14 2 217 241
57. Thomas, R.: Graph structure and decomposition: well-quasi-ordering. Lecture at NSF/CBMS Regional Conference in Mathematical Sciences on Geometric Graph Theory May-June 2002. www.math.gatech.edu/~thomas/SLIDE/CBMS/wqo.pdf
58. R. Thomas J.M. Thomson 2000 Excluding minors in nonplanar graphs of girth at least five Comb. Probab. Comput. 9 6 573 585 (Pubitemid 33232578)
59. Thorup, M.: Map graphs in polynomial time. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp. 396-407 (1998)