Diameter and treewidth in minor-closed graph families, revisited

Algorithmica (New York)

Volumn 40, Issue 3, 2004, Pages 211-215

  Demaine, Erik D ^a   Hajiaghayi, Mohammad Taghi ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Apex graphs; Approximation algorithms; Bounded local treewidth; Graph algorithms; Graph minors

Indexed keywords

APPROXIMATION THEORY; COMPUTER SCIENCE; FUNCTIONS; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

APEX GRAPH; APPROXIMATION ALGORITHMS; BOUNDED LOCAL TREEWIDTH; GRAPH ALGORITHMS; GRAPH MINORS;

ALGORITHMS;

EID: 13644255055     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1106-1     Document Type: Article

References (9)

1. B. S. Baker. Approximation algorithms for NP-eomplete problems on planar graphs, J. ACM, 41 (1994), 153-180.
2. E. D. Demaine, M. Hajiaghayi, N. Nishimura, P. Ragde, and D. M. Thilikos, Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, J. Comput. System Sci., to appear.
3. R. Diestel, Graph Theory, Graduate Texts in Mathematics, Vol. 173, Springer-Verlag, New York, 2000.
4. R. Diestel, T. R. Jensen. K. Y. Gorbunov, and C. Thomassen, Highly connected sets and the excluded grid theorem, J. Combin. Theory Ser. B, 75 (1999), 61-73.
5. D. Eppstein, Diameter and treewidth in minor-closed graph families, Algorithmica, 27 (2000), 275-291.
6. M. Frick and M. Grohe, Deciding first-order properties of locally tree-decomposable graphs, J. ACM, 48 (2001), 1184-1206.
7. M. Grohe, Local tree-width, excluded minors, and approximation algorithms, Combinatorica, 23 (2003). 613-632.
8. M. Hajiaghayi and N. Nishimura, Subgraph isomorphism, log-bounded fragmentation and graphs of (locally) bounded treewidth, in Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (Poland, 2002), 2002, pp. 305-318.
9. N. Robertson, P. Seymour, and R. Thomas. Quickly excluding a planar graph, J. Combin. Theory Ser. B. 62 (1994), 323-348.