Results 131 to 140 of about 2,730 (147)
On the treewidth and pathwidth of permutation graphs
, 1992 Kloks, A.J.J., Bodlaender, H.L.
openaire +2 more sources
Lower bounds on the pathwidth of some grid-like graphs
, 2007 John Ellis, Robert Warren
openalex +1 more source
A Quartic Kernel for Pathwidth-One Vertex Deletion
, 2010 Geevarghese Philip +2 more
openalex +2 more sources
Finding Light Spanners in Bounded Pathwidth Graphs
, 2011 Michelangelo Grigni, Hao-Hsiang Hung
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Online Problems, Pathwidth, and Persistence [PDF]
, 2004 We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bounded width, good online algorithms may exist for a number of natural problems. In the work presented we concentrate on online graph coloring problems, where we restrict the allowed ...
Catherine McCartin, Rodney G. Downey
openaire +1 more source
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
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
treewidth pathwidth and cospan decompositions
Electronic Communication of The European Association of Software Science and Technology, 2011OA ...
Blume, Christoph +3 more
openaire +2 more sources