Results 111 to 120 of about 1,027 (141)
The microparticulate inks for bioprinting applications. [PDF]
Mater Today BioAn C +9 more
europepmc +1 more source
On the treewidth and pathwidth of permutation graphs
, 1992 Kloks, A.J.J., Bodlaender, H.L.
openaire +2 more sources
Outerplanar Obstructions for Matroid Pathwidth
Electronic Notes in Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koichi Yamazaki, Dimitrios M Thilikos
exaly +9 more sources
Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs [PDF]
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koichi Yamazaki
exaly +3 more sources
Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth [PDF]
Journal of Experimental Algorithmics, 2016 Path decompositions of graphs are an important ingredient of dynamic programming algorithms for solving efficiently many NP-hard problems. Therefore, computing the pathwidth and associated path decomposition of graphs has both a theoretical and practical interest.
David Coudert +2 more
exaly +5 more sources
Approximating the pathwidth of outerplanar graphs
Information Processing Letters, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A Langston
exaly +4 more sources
CSP duality and trees of bounded pathwidth [PDF]
Theoretical Computer Science, 2010 We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of homomorphism dualities involving trees of bounded pathwidth and in algebraic terms. For this, we introduce a new parameter for trees that closely approximates pathwidth and can
VĂCTOR Dalmau, Andrei Krokhin
exaly +4 more sources
From Pathwidth to Connected Pathwidth [PDF]
SIAM Journal on Discrete Mathematics, 2012 It is proven that the connected pathwidth of any graph $G$ is at most $2\cdot\pw(G)+1$, where $\pw(G)$ is the pathwidth of $G$. The method is constructive, i.e. it yields an efficient algorithm that for a given path decomposition of width $k$ computes a connected path decomposition of width at most $2k+1$. The running time of the algorithm is $O(dk^2)$,
Dariusz Dereniowski
exaly +7 more sources
Outerplanar obstructions for matroid pathwidth
Discrete Mathematics, 2014 For each non-negative integer k, we provide all outerplanar obstructions for the class of graphs whose cycle matroid has pathwidth at most k. Our proof combines a decomposition lemma for proving lower bounds on matroid pathwidth and a relation between ...
Koichi Yamazaki, Dimitrios M Thilikos
exaly +2 more sources