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

05/02/2020
by   Peter Gartland, et al.
0

We present an algorithm that takes as input a graph G with weights on the vertices, and computes a maximum weight independent set S of G. If the input graph G excludes a path P_k on k vertices as an induced subgraph, the algorithm runs in time n^O(k^2 log^3 n). Hence, for every fixed k our algorithm runs in quasi-polynomial time. This resolves in the affirmative an open problem of [Thomassé, SODA'20 invited presentation]. Previous to this work, polynomial time algorithms were only known for P_4-free graphs [Corneil et al., DAM'81], P_5-free graphs [Lokshtanov et al., SODA'14], and P_6-free graphs [Grzesik et al., SODA'19]. For larger values of t, only 2^O(√(knlog n)) time algorithms [Bascó et al., Algorithmica'19] and quasi-polynomial time approximation schemes [Chudnovsky et al., SODA'20] were known. Thus, our work is the first to offer conclusive evidence that Independent Set on P_k-free graphs is not NP-complete for any integer k. Additionally we show that for every graph H, if there exists a quasi-polynomial time algorithm for Independent Set on C-free graphs for every connected component C of H, then there also exists a quasi-polynomial time algorithm for Independent Set on H-free graphs. This lifts our quasi-polynomial time algorithm to T_k-free graphs, where T_k has one component that is a P_k, and k-1 components isomorphic to a fork (the unique 5-vertex tree with a degree 3 vertex).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/21/2020

Independent Set on C_≥ k-Free Graphs in Quasi-Polynomial Time

We give an algorithm that takes as input a graph G with weights on the v...
research
04/11/2018

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

In algorithmic graph theory, a classic open question is to determine the...
research
05/25/2023

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time

We show that the Maximum Weight Independent Set problem (MWIS) can be so...
research
09/28/2020

Quasi-polynomial-time algorithm for Independent Set in P_t-free graphs via shrinking the space of induced paths

In a recent breakthrough work, Gartland and Lokshtanov [FOCS 2020] showe...
research
07/10/2019

Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs

In the Maximum Independent Set problem we are asked to find a set of pai...
research
02/16/2023

Maximum Independent Set when excluding an induced minor: K_1 + tK_2 and tC_3 ⊎ C_4

Dallard, Milanič, and Štorgel [arXiv '22] ask if for every class excludi...
research
08/15/2020

Finding a Shortest Even Hole in Polynomial Time

An even (respectively, odd) hole in a graph is an induced cycle with eve...

Please sign up or login with your details

Forgot password? Click here to reset