Results 121 to 130 of about 1,027 (141)

Tournament pathwidth and topological containment

Journal of Combinatorial Theory Series B, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Seymour
exaly   +4 more sources

On self duality of pathwidth in polyhedral graph embeddings

Journal of Graph Theory, 2007
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 of a graph with the cut-width of its medial graph and we extend it to bounded ...
Fedor V Fomin, Dimitrios M Thilikos
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Pathwidth of Planar and Line Graphs

Graphs and Combinatorics, 2003
The 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\).
Fedor V Fomin
exaly   +2 more sources

Directed Pathwidth and Palletizers

2015
In 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, Jochen Rethmann, Egon Wanke   +2 more
openaire   +2 more sources

PATHWIDTH AND LAYERED DRAWINGS OF TREES

International Journal of Computational Geometry & Applications, 2004
An 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

Pathwidth of cubic graphs and exact algorithms

Information Processing Letters, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fedor V Fomin
exaly   +2 more sources

Online Problems, Pathwidth, and Persistence

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 ...
Rodney G. Downey, Catherine McCartin
openaire   +2 more sources

Pathwidth and Searching in Parameterized Threshold Graphs

2010
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 chordal and threshold graphs. We define a chordal+1v graph as a graph that can be made into a chordal graph by removing a vertex.
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shashank, C. Pandu Rangan   +3 more
openaire   +1 more source

Submodular Minimization via Pathwidth

2012
In this paper, we present a submodular minimization algorithm based on a new relationship between minimizers of a submodular set function and pathwidth defined on submodular set functions. Given a submodular set function f on a finite set V with n ≥2 elements and an ordered pair s ,t ∈V , let λ s ,t denote the minimum f (X ) over all sets X with s ∈X ...
openaire   +2 more sources

Treewidth, Pathwidth and Cospan Decompositions.

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011
OA ...
Blume, Christoph, Sander Bruggink, H.J., Friedrich, Martin, König, Barbara   +3 more
openaire   +2 more sources