The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs

by   Thomas Bellitto, et al.

The notion of forbidden-transition graphs allows for a robust generalization of walks in graphs. In a forbidden-transition graph, every pair of edges incident to a common vertex is permitted or forbidden; a walk is compatible if all pairs of consecutive edges on the walk are permitted. Forbidden-transition graphs and related models have found applications in a variety of fields, such as routing in optical telecommunication networks, road networks, and bio-informatics. We initiate the study of fundamental connectivity problems from the point of view of parameterized complexity, including an in-depth study of tractability with regards to various graph-width parameters. Among several results, we prove that finding a simple compatible path between given endpoints in a forbidden-transition graph is W[1]-hard when parameterized by the vertex-deletion distance to a linear forest (so it is also hard when parameterized by pathwidth or treewidth). On the other hand, we show an algebraic trick that yields tractability when parameterized by treewidth of finding a properly colored Hamiltonian cycle in an edge-colored graph; properly colored walks in edge-colored graphs is one of the most studied special cases of compatible walks in forbidden-transition graphs.


page 1

page 2

page 3

page 4


The Parameterized Complexity of the Survivable Network Design Problem

For the well-known Survivable Network Design Problem (SNDP) we are given...

Edge Deletion to Restrict the Size of an Epidemic

Given a graph G=(V,E), a set ℱ of forbidden subgraphs, we study ℱ-Free E...

Parameterized complexity of edge-coloured and signed graph homomorphism problems

We study the complexity of graph modification problems for homomorphism-...

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model

We study a generalization of the classic Spanning Tree problem that allo...

Interference-free Walks in Time: Temporally Disjoint Paths

We investigate the computational complexity of finding temporally disjoi...

Parameterized Orientable Deletion

A graph is d-orientable if its edges can be oriented so that the maximum...

Compatibility, embedding and regularization of non-local random walks on graphs

Several variants of the graph Laplacian have been introduced to model no...

Please sign up or login with your details

Forgot password? Click here to reset