18 search results - page 1 / 4 » From Pathwidth to Connected Pathwidth |
CORR
2010
Springer
13 years 1 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2
JGT
2007
13 years 4 months ago
2007
: Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G. We prove this result by relating the pathwidth...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
MFCS
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...