Diameter and Treewidth in Minor-Closed Graph Families, Revisited
by
Erik D. Demaine
,
Mohammadtaghi Hajiaghayi
| Venue: | ALGORITHMICA |
| Citations: | 7 - 5 self |
BibTeX
@MISC{Demaine_diameterand,
author = {Erik D. Demaine and Mohammadtaghi Hajiaghayi},
title = { Diameter and Treewidth in Minor-Closed Graph Families, Revisited},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes, e.g., planar graphs. This characterization has been used as the basis for several (approximation) algorithms on such graphs (e.g., [2,5–8]). The proof of Eppstein is complicated. In this short paper we obtain the same characterization with a simple proof. In addition, the relation between treewidth and diameter is slightly better and explicit.
Citations
| 260 | Approximation algorithms for NP-complete problems on planar graphs - Baker - 1994 |
| 94 | Quickly excluding a planar graph - Robertson, Seymour, et al. - 1994 |
| 89 | Graph Theory (Graduate Texts - Diestel - 2005 |
| 64 | Diameter and treewidth in minor-closed graph families - Eppstein |
| 64 | Deciding first-order properties of locally tree-decomposable structures - Frick, Grohe |
| 62 | Graph Theory, Graduate Texts in Mathematics 173 - Diestel - 2003 |
| 46 | Local tree-width, excluded minors, and approximation algorithms, arXiv.org e-Print archive - Grohe - 2000 |
| 26 | Highly connected sets and the excluded grid theorem - Diestel, Jensen, et al. - 1999 |
| 22 | Approximation algorithms for classes of graphs excluding single-crossing graphs as minors - Demaine, Hajiaghayi, et al. |
| 8 | Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth - HAJIAGHAYI, NISHIMURA |
