Subexponential-time Algorithms for Maximum Independent Set in P_t-free and Broom-free Graphs

04/11/2018
by   Gábor Bacsó, et al.
0

In algorithmic graph theory, a classic open question is to determine the complexity of the Maximum Independent Set problem on P_t-free graphs, that is, on graphs not containing any induced path on t vertices. So far, polynomial-time algorithms are known only for t< 5 [Lokshtanov et al., SODA 2014, 570--581, 2014], and an algorithm for t=6 announced recently [Grzesik et al. Arxiv 1707.05491, 2017]. Here we study the existence of subexponential-time algorithms for the problem: we show that for any t> 1, there is an algorithm for Maximum Independent Set on P_t-free graphs whose running time is subexponential in the number of vertices. Even for the weighted version MWIS, the problem is solvable in 2^O(√(tn n)) time on P_t-free graphs. For approximation of MIS in broom-free graphs, a similar time bound is proved. Scattered Set is the generalization of Maximum Independent Set where the vertices of the solution are required to be at distance at least d from each other. We give a complete characterization of those graphs H for which d-Scattered Set on H-free graphs can be solved in time subexponential in the size of the input (that is, in the number of vertices plus the number of edges): If every component of H is a path, then d-Scattered Set on H-free graphs with n vertices and m edges can be solved in time 2^O(|V(H)|√(n+m) (n+m)), even if d is part of the input. Otherwise, assuming the Exponential-Time Hypothesis (ETH), there is no 2^o(n+m)-time algorithm for d-Scattered Set for any fixed d> 3 on H-free graphs with n-vertices and m-edges.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/02/2020

Independent Set on P_k-Free Graphs in Quasi-Polynomial Time

We present an algorithm that takes as input a graph G with weights on th...
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
08/31/2018

Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs

In a directed graph G=(V,E) with a capacity on every edge, a bottleneck ...
research
12/13/2018

Polygon Simplification by Minimizing Convex Corners

Let P be a polygon with r>0 reflex vertices and possibly with holes and ...
research
02/19/2021

Gerrymandering on graphs: Computational complexity and parameterized algorithms

Partitioning a region into districts to favor a particular candidate or ...
research
08/29/2023

Lower Bound for Independence Covering in C_4-Free Graphs

An independent set in a graph G is a set S of pairwise non-adjacent vert...
research
05/26/2021

On Alternative Models for Leaf Powers

A fundamental problem in computational biology is the construction of ph...

Please sign up or login with your details

Forgot password? Click here to reset