Sciweavers

WALCOM
2010
IEEE
351views Algorithms» more  WALCOM 2010»
13 years 4 months ago
Pathwidth and Searching in Parameterized Threshold Graphs
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shas...
JGT
2007
81views more  JGT 2007»
13 years 6 months ago
Pathwidth of outerplanar graphs
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved...
David Coudert, Florian Huc, Jean-Sébastien ...
JGT
2007
85views more  JGT 2007»
13 years 6 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»
13 years 6 months 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