Improved bounds on the planar branchwidth with respect to the largest grid minor size

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

Volumn 6507 LNCS, Issue PART 2, 2010, Pages 85-96

  Gu, Qian Ping ^a   Tamaki, Hisao ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b MEIJI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCHWIDTH; CARTESIAN PRODUCTS; GRAPH G; OPTIMAL BRANCH-DECOMPOSITION; PLANAR GRAPH; POSITIVE CONSTANT; QUADRATIC TIME; UPPER BOUND; GRID MINORS;

GRAPH THEORY; GRAPHIC METHODS; APPROXIMATION ALGORITHMS;

APPROXIMATION ALGORITHMS; GRAPH THEORY;

EID: 78650877925     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17514-5_8     Document Type: Conference Paper

References (21)

1. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153-180 (1994)
2. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209, 1-45 (1998)
3. Bodlaender, H.L., Feremans, C., Grigoriev, A., Penninkx, E., Sitters, R., Wolle, T.: On the minimum corridor connection problem and other generalized geometric problems. Computational Geometry: Theory and Applications 42, 939-951 (2009)
4. Bodlaender, H.L., Grigoriev, A., Koster, A.M.C.A.: Treewidth lower bounds with brambles. Algorithmica 51(1), 81-98 (2008)
5. Dorn, F., Fomin, F.V., Thilikos, D.M.: Catalan structures and dynamic programming in H-minor-free graphs. In: Proc. of the 2008 Symposium on Discrete Algorithms, SODA 2008, pp. 631-640 (2008)
6. Demaine, E.D., Hajiaghayi, M.T.: Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. In: Proc. of the 2005 Symposium on Discrete Algorithms, SODA 2005, pp. 682-689 (2005)
7. Demaine, E.D., Hajiaghayi, M.T.: Bidimensionality, map graphs, and grid minors, arXiv:Computer Science, DM/052070, v1 (2005)
8. Demaine, E.D., Hajiaghayi, M.T., Kawarabayashi, K.: Algorithmic graph minor theory: decomposition, approximation, and coloring. In: Proc. of the 2005 IEEE Symposium on Foundation of Computer Science, FOCS 2005, pp. 637-646 (2005)
9. Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 95-106. Springer, Heidelberg (2005)
10. Grigoriev, A.: Tree-width and large grid minors in planar graphs (2008) (submitted for publication)
11. Grigoriev, A., Marchal, B., Usotskaya, N.: On planar graphs with large treewidth and small grid minors. Electronic Notes in Discrete Mathematics 32, 35-42 (2009)
12. 3) time. ACM Trans. Algorithms 4(3), article No.30, 1-13 (2008)
13. 1+ε) time. In: Proc. of the 2009 International Symposium on Algorithms and Computation (ISAAC 2009), pp. 984-993 (2009)
14. Gu, Q.P., Tamaki, H.: Improved bounds on the planar branchwidth with respect to the largest grid minor size, Technical Report, SFU-CMPT-TR 2009-17 (July 2009)
15. Gu, Q.P., Tamaki, H.: A radius-based linear-time-constructive upper bound on the branchwidth of planar hypergrpahs, Technical Report, SFU-CMPT-TR 2009-21 (November 2009)
16. Robertson, N., Seymour, P.D.: Graph minors III. Planar tree-width. J. of Combinatorial Theory, Series B 36, 49-64 (1984)
17. Robertson, N., Seymour, P.D.: Graph minors X. Obstructions to tree decomposition. J. of Combinatorial Theory, Series B 52, 153-190 (1991)
18. Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. of Combinatorial Theory, Series B 62, 323-348 (1994)
19. Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217-241 (1994)
20. Thomas, R.: Tree decompositions of graphs, http://www.math.gatech.edu/ ~thomas/SLIDE/slide2.ps,p.32
21. Tamaki, H.: A linear time heuristic for the branch-decomposition of planar graphs. In: Proc. of 11th Annual European Symposium on Algorithms, pp. 765-775 (2003)