On tree width, bramble size, and expansion

Journal of Combinatorial Theory. Series B

Volumn 99, Issue 1, 2009, Pages 218-228

  Grohe, Martin ^a   Marx, Dániel ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Bramble; Expander graphs; Expansion; Tree width

Indexed keywords

EID: 56449130114     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2008.06.004     Document Type: Article

References (8)

1. Angluin D., and Valiant L.G. Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. System Sci. 18 2 (1979) 155-193
2. Feige U., Hajiaghayi M.T., and Lee J.R. Improved approximation algorithms for minimum-weight vertex separators. STOC'05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (2005), ACM, New York 563-572
3. Flum J., and Grohe M. Parameterized Complexity Theory. Texts Theoret. Comput. Sci. EATCS Ser. (2006), Springer-Verlag, Berlin
4. Hoory S., Linial N., and Wigderson A. Expander graphs and their applications. Bull. Amer. Math. Soc. 43 (2006) 439-561
5. Marx D. Can you beat treewidth?. 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) (2007) 169-179
6. Reed B. Tree width and tangles: A new connectivity measure and some applications. In: Bailey R.A. (Ed). Surveys in Combinatorics. London Math. Soc. Lecture Note Ser. vol. 241 (1997), Cambridge University Press 87-162
7. Robertson N., and Seymour P.D. Graph minors XX. Wagner's conjecture. J. Combin. Theory Ser. B 92 (2004) 325-357
8. Seymour P.D., and Thomas R. Graph searching and a min-max theorem for tree-width. J. Combin. Theory Ser. B 58 (1993) 22-33