Finding small-width connected path decompositions in polynomial time

02/15/2018
by   Ariusz Dereniowski, et al.
0

A connected path decomposition of a simple graph G is a path decomposition (X_1,...,X_l) such that the subgraph of G induced by X_1∪...∪ X_i is connected for each i∈{1,...,l}. The connected pathwidth of G is then the minimum width over all connected path decompositions of G. We prove that for each fixed k, the connected pathwidth of any input graph can be computed in polynomial-time. This answers an open question raised by Fedor V. Fomin during the GRASTA 2017 workshop, since connected pathwidth is equivalent to the connected (monotone) node search game.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/24/2020

A linear fixed parameter tractable algorithm for connected pathwidth

The graph parameter of pathwidth can be seen as a measure of the topolog...
research
04/01/2020

A polynomial time algorithm to compute the connected tree-width of a series-parallel graph

It is well known that the treewidth of a graph G corresponds to the node...
research
12/12/2017

Minors of two-connected graphs of large path-width

Let P be a graph with a vertex v such that P v is a forest, and let Q be...
research
08/17/2021

Minimum degree conditions for containing an r-regular r-connected subgraph

We study optimal minimum degree conditions when an n-vertex graph G cont...
research
07/13/2023

(k-2)-linear connected components in hypergraphs of rank k

We define a q-linear path in a hypergraph H as a sequence (e_1,…,e_L) of...
research
01/19/2018

Angle-Monotone Graphs: Construction and Local Routing

A geometric graph in the plane is angle-monotone of width γ if every pai...
research
02/06/2018

On the chordality of polynomial sets in triangular decomposition in top-down style

In this paper the chordal graph structures of polynomial sets appearing ...

Please sign up or login with your details

Forgot password? Click here to reset