Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ALGORITHMICA
2004

favoriteEmaildiscussreport

130views more ALGORITHMICA 2004»

Diameter and Treewidth in Minor-Closed Graph Families, Revisited

13 years 4 months ago

Diameter and Treewidth in Minor-Closed Graph Families, Revisited

Download www-math.mit.edu

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

Erik D. Demaine, Mohammad Taghi Hajiaghayi

Real-time Traffic

ALGORITHMICA 2004 | Eppstein | Minor-closed Graph Families | Planar Graphs |

claim paper

Related Content

» On Universal Graphs of Minor Closed Families

» Every MinorClosed Property of Sparse Graphs is Testable

» Subgraph Isomorphism in Planar Graphs and Related Problems

» The Bidimensional Theory of BoundedGenus Graphs

» Finding shortest nontrivial cycles in directed graphs on surfaces

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2004
Where	ALGORITHMICA
Authors	Erik D. Demaine, Mohammad Taghi Hajiaghayi

Comments (0)