DeepAI AI Chat
Log In Sign Up

Well-partitioned chordal graphs: obstruction set and disjoint paths

by   Jungho Ahn, et al.

We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the vertex set into cliques that can be arranged in a star structure, the leaves of which are of size one. Well-partitioned chordal graphs are a generalization of this concept in the following two ways. First, the cliques in the partition can be arranged in a tree structure, and second, each clique is of arbitrary size. We provide a characterization of well-partitioned chordal graphs by forbidden induced subgraphs, and give a polynomial-time algorithm that given any graph, either finds an obstruction, or outputs a partition of its vertex set that asserts that the graph is well-partitioned chordal. We demonstrate the algorithmic use of this graph class by showing that two variants of the problem of finding pairwise disjoint paths between k given pairs of vertices is in FPT parameterized by k on well-partitioned chordal graphs, while on chordal graphs, these problems are only known to be in XP. From the other end, we observe that there are problems that are polynomial-time solvable on split graphs, but become NP-complete on well-partitioned chordal graphs.


page 1

page 2

page 3

page 4


On Convexity in Split graphs: Complexity of Steiner tree and Domination

Given a graph G with a terminal set R ⊆ V(G), the Steiner tree problem (...

Partitioning sparse graphs into an independent set and a graph with bounded size components

We study the problem of partitioning the vertex set of a given graph so ...

Additive Pattern Database Heuristics

We explore a method for computing admissible heuristic evaluation functi...

A Partition-centric Distributed Algorithm for Identifying Euler Circuits in Large Graphs

Finding the Eulerian circuit in graphs is a classic problem, but inadequ...

Generalized partitioned local depth

In this paper we provide a generalization of the concept of cohesion as ...

Snapshot disjointness in temporal graphs

In the study of temporal graphs, only paths respecting the flow of time ...

Communication-Channel Optimized Partition

Given an original discrete source X with the distribution p_X that is co...