Sciweavers

Share
18 search results - page 1 / 4
» From Pathwidth to Connected Pathwidth
Sort
View
CORR
2010
Springer
126views Education» more  CORR 2010»
8 years 8 months ago
From Pathwidth to Connected Pathwidth
It is proven that the connected pathwidth of any graph G is at most 2
Dariusz Dereniowski
JGT
2007
85views more  JGT 2007»
8 years 12 months ago
On self duality of pathwidth in polyhedral graph embeddings
: 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...
Fedor V. Fomin, Dimitrios M. Thilikos
CORR
2007
Springer
132views Education» more  CORR 2007»
9 years 2 days ago
Matroid Pathwidth and Code Trellis Complexity
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 ...
Navin Kashyap
SWAT
2000
Springer
94views Algorithms» more  SWAT 2000»
9 years 3 months ago
Embeddings of k-Connected Graphs of Pathwidth k
Arvind Gupta, Naomi Nishimura, Andrzej Proskurowsk...
MFCS
2005
Springer
9 years 5 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
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...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
books