Results 141 to 150 of about 2,587 (156)
Two Results on Layered Pathwidth and Linear Layouts [PDF]
, 2020 Vida Dujmović, Pat Morin, Céline Yelle
openalex
Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth
, 2019 Martin Dyer +2 more
openalex +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.
Related searches:
Related searches:
PATHWIDTH AND LAYERED DRAWINGS OF TREES
International Journal of Computational Geometry & Applications, 2004An h-layer drawing of a graph G is a planar drawing of G in which each vertex is placed on one of h parallel lines and each edge is drawn as a straight line between its end-vertices. In such a drawing, we say that an edge is proper if its endpoints lie on adjacent layers, flat if they lie on the same layer and long otherwise.
openaire +2 more sources
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.
Frank Gurski +2 more
openaire +1 more source
Pathwidth of Planar and Line Graphs
Graphs and Combinatorics, 2003The paper studies the pathwidth \(\text{pw}(G)\) of planar graphs and proves that for any 2-connected plane graph \(G\) with pathwidth \(\text{pw}(G^*)\) of the geometric dual graph \(G^*\) of \(G\) is smaller than the pathwidth \(\text{pw}(L(G))\) of the line graph \(L(G)\) of \(G\).
openaire +1 more source
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Algorithmica, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fomin, Fedor V. +2 more
openaire +4 more sources
Near Unanimity Constraints Have Bounded Pathwidth Duality
2012 27th Annual IEEE Symposium on Logic in Computer Science, 2012We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded pathwidth duality, putting the problem in nondeterministic logspace. This generalizes the analogous result of Dalmau and Krokhin for majority polymorphisms and lends further ...
Barto, Libor +2 more
openaire +2 more sources