Results 111 to 120 of about 609 (128)

Improved approximation for 3-dimensional matching via bounded pathwidth local search

, 2013
Marek Cygan
openalex   +2 more sources

Randomly coloring graphs of logarithmically bounded pathwidth

, 2018
Shai Vardi
openalex   +1 more source

Cycle decompositions of pathwidth-6 graphs

, 2017
Elke C. Fuchs, Laura Gellert, Irene Heinrich   +2 more
openalex   +2 more sources

Bounding the number of $(σ,ρ)$-dominating sets in trees, forests and graphs of bounded pathwidth

, 2019
Matthieu Rosenfeld
openalex   +2 more sources

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, Venkatesh Raman, Yngve Villanger   +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:

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.
Egon Wanke, Frank Gurski, Jochen Rethmann   +2 more
openaire   +2 more sources