Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument

03/09/2022
by   Konrad Majewski, et al.
0

We revisit recent developments for the Maximum Weight Independent Set problem in graphs excluding a subdivided claw S_t,t,t as an induced subgraph [Chudnovsky, Pilipczuk, Pilipczuk, Thomassé, SODA 2020] and provide a subexponential-time algorithm with improved running time 2^𝒪(√(n)log n) and a quasipolynomial-time approximation scheme with improved running time 2^𝒪(ε^-1log^5 n). The Gyárfás' path argument, a powerful tool that is the main building block for many algorithms in P_t-free graphs, ensures that given an n-vertex P_t-free graph, in polynomial time we can find a set P of at most t-1 vertices, such that every connected component of G-N[P] has at most n/2 vertices. Our main technical contribution is an analog of this result for S_t,t,t-free graphs: given an n-vertex S_t,t,t-free graph, in polynomial time we can find a set P of 𝒪(t log n) vertices and an extended strip decomposition (an appropriate analog of the decomposition into connected components) of G-N[P] such that every particle (an appropriate analog of a connected component to recurse on) of the said extended strip decomposition has at most n/2 vertices.

READ FULL TEXT

page 1

page 3

page 5

page 7

page 11

page 17

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
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
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
07/12/2021

Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws

For graphs G and H, we say that G is H-free if it does not contain H as ...
research
12/24/2019

Maximum independent sets in (pyramid, even hole)-free graphs

A hole in a graph is an induced cycle with at least 4 vertices. A graph ...
research
02/16/2018

The Vertex Sample Complexity of Free Energy is Polynomial

We study the following question: given a massive Markov random field on ...
research
02/02/2022

Passing the Limits of Pure Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs

In this paper, we consider the task of computing an independent set of m...

Please sign up or login with your details

Forgot password? Click here to reset