Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

08/27/2018
by   Iyad Kanj, et al.
0

A fundamental graph problem is to recognize whether the vertex set of a graph G can be bipartitioned into sets A and B such that G[A] and G[B] satisfy properties P_A and P_B, respectively. This so-called (P_A,P_B)-RECOGNITION problem generalizes amongst others the recognition of 3-colorable, bipartite, split, and monopolar graphs. A powerful algorithmic technique that can be used to obtain fixed-parameter algorithms for many cases of (P_A,P_B)-RECOGNITION, as well as several other problems, is the pushing process. For bipartition problems, the process starts with an "almost correct" bipartition (A',B'), and pushes appropriate vertices from A' to B' and vice versa to eventually arrive at a correct bipartition. In this paper, we study whether (P_A,P_B)-RECOGNITION problems for which the pushing process yields fixed-parameter algorithms also admit polynomial problem kernels. In our study, we focus on the first level above triviality, where P_A is the set of P_3-free graphs (disjoint unions of cliques, or cluster graphs), the parameter is the number of clusters in the cluster graph G[A], and P_B is characterized by a set H of connected forbidden induced subgraphs. We prove that, under the assumption that NP is not contained in coNP/poly, (P_A,P_B)-RECOGNITION admits a polynomial kernel if and only if H contains a graph of order at most 2. In both the kernelization and the lower bound results, we make crucial use of the pushing process.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2022

Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs

Paths P_1,…, P_k in a graph G=(V,E) are mutually induced if any two dist...
research
11/28/2017

On Structural Parameterizations of Firefighting

The Firefighting problem is defined as follows. At time t=0, a fire brea...
research
12/17/2020

Induced Disjoint Paths in AT-free Graphs

Paths P_1,…,P_k in a graph G=(V,E) are mutually induced if any two disti...
research
10/03/2020

On the monophonic rank of a graph

A set of vertices S of a graph G is monophonically convex if every induc...
research
02/24/2022

Parameterized Complexity of Graph Partitioning into Connected Clusters

Given an undirected graph G and q integers n_1,n_2,n_3, ⋯, n_q, balanced...
research
10/10/2018

Parameterized Complexity of Independent Set in H-Free Graphs

In this paper, we investigate the complexity of Maximum Independent Set ...
research
04/16/2021

Minimal obstructions to (s,1)-polarity in cographs

Let k,l be nonnegative integers. A graph G is (k,l)-polar if its vertex ...

Please sign up or login with your details

Forgot password? Click here to reset