Results 1 to 10 of about 2,324 (124)
On Exploring Temporal Graphs of Small Pathwidth [PDF]
arXiv, 2018 We show that the Temporal Graph Exploration Problem is NP-complete, even when the underlying graph has pathwidth 2 and at each time step, the current graph is connected.
Bodlaender, Hans L. +1 more
arxiv +9 more sources
Pathwidth of outerplanar graphs
, 2006 We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin, after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual plus two, conjectured that there exists a constant $c ...
Coudert, David +2 more
openaire +4 more sources
CSP duality and trees of bounded pathwidth
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
Carvalho, Catarina +2 more
openaire +3 more sources
Tree-decompositions of small pathwidth
Electronic Notes in Discrete Mathematics, 2001 AbstractMotivated by the desire to speed up dynamic programming algorithms for graphs of bounded treewidth, we initiate a study of the tradeoff between width and pathwidth of tree-decompositions. We therefore investigate the catwidth parameter catw(G) which is the minimum width of any tree-decomposition (T,X) of a graph G when the pathwidth pw(T) of ...
openaire +3 more sources
Strong-mixed searching and pathwidth [PDF]
Journal of Combinatorial Optimization, 2006 In this paper, we propose a new search model, called strong-mixed search, which is a generalization of the mixed search. We show that the strong-mixed search number of a graph equals the pathwidth of the graph. We also describe relationships between the strong-mixed search number and other search numbers.
openaire +2 more sources
The Treewidth and Pathwidth of Graph Unions
SIAM Journal on Discrete MathematicsGiven two $n$-vertex graphs $G_1$ and $G_2$ of bounded treewidth, is there an $n$-vertex graph $G$ of bounded treewidth having subgraphs isomorphic to $G_1$ and $G_2$? Our main result is a negative answer to this question, in a strong sense: we show that the answer is no even if $G_1$ is a binary tree and $G_2$ is a ternary tree.
Bogdan Alecu +5 more
openaire +2 more sources
On the treewidth and pathwidth of permutation graphs
, 1992 Kloks, A.J.J., Bodlaender, H.L.
openaire +2 more sources
Some of the next articles are maybe not open access.
Directed Pathwidth and Palletizers
2015In delivery industry, bins have to be stacked-up from conveyor belts onto pallets. Given k sequences of labeled bins and a positive integer p. The goal is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto a pallet located at one of p stack-up places.
Egon Wanke +2 more
openaire +2 more sources
Approximating the pathwidth of outerplanar graphs
Information Processing Letters, 1998Pathwidth is a well-known NP-complete graph metric. We present a technique to approximate the pathwidth of outerplanar graphs. Although a polynomial-time algorithm is already known to determine the pathwidth of outerplanar graphs, this algorithm is not practical.
Rajeev Govindan +2 more
openaire +2 more sources