Diameter and Treewidth in Minor-Closed Graph Families, Revisited

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

• Type: Journal
• Year: 2004
• Where: ALGORITHMICA
• Authors: Erik D. Demaine, Mohammad Taghi Hajiaghayi
• Keywords: ALGORITHMICA 2004, Eppstein, Minor-closed Graph Families, Planar Graphs