Sciweavers

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

127

Voted

CORR
2010
Springer

126views Education» more CORR 2010»

From Pathwidth to Connected Pathwidth

15 years 10 days ago

From Pathwidth to Connected Pathwidth

Download drops.dagstuhl.de

It is proven that the connected pathwidth of any graph G is at most 2

Dariusz Dereniowski

Real-time Traffic

Connected Path Decomposition | CORR 2010 | Education | Efficient Algorithm | Path Decomposition |

claim paper

Related Content

» On self duality of pathwidth in polyhedral graph embeddings

» Matroid Pathwidth and Code Trellis Complexity

» Embeddings of kConnected Graphs of Pathwidth k

» Nondeterministic Graph Searching From Pathwidth to Treewidth

» Note on a Helicopter Search Problem on Graphs

» Majority constraints have bounded pathwidth duality

» Partitions and Coverings of Trees by BoundedDegree Subtrees

» Graph Searching Elimination Trees and a Generalization of Bandwidth

» The Art of Trellis Decoding Is NPHard

Post Info
More Details (n/a)

Added	22 Mar 2011
Updated	22 Mar 2011
Type	Journal
Year	2010
Where	CORR
Authors	Dariusz Dereniowski

Comments (0)