6 search results - page 1 / 2 » Diameter and Treewidth in Minor-Closed Graph Families, Revis... |
ALGORITHMICA
2004
15 years 4 days ago
2004
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 characterizatio...
101
Voted
ENDM
2008
15 years 10 days ago
2008
For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is a...
104
click to vote
ECCC
2008
15 years 10 days ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
132
click to vote
CORR
1999
Springer
14 years 12 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
123
Voted
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....