Maximum Weight Independent Sets for (S_1,2,4,Triangle)-Free Graphs in Polynomial Time

06/22/2018
by   Andreas Brandstädt, et al.
0

The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum weight sum. MWIS is one of the most investigated and most important algorithmic graph problems; it is well known to be NP-complete, and it remains NP-complete even under various strong restrictions such as for triangle-free graphs. Its complexity for P_k-free graphs, k > 7, is an open problem. In BraMos2018, it is shown that MWIS can be solved in polynomial time for (P_7,triangle)-free graphs. This result is extended by Maffray and Pastor MafPas2016 showing that MWIS can be solved in polynomial time for (P_7,bull)-free graphs. In the same paper, they also showed that MWIS can be solved in polynomial time for (S_1,2,3,bull)-free graphs. In this paper, using a similar approach as in BraMos2018, we show that MWIS can be solved in polynomial time for (S_1,2,4,triangle)-free graphs which generalizes the result for (P_7,triangle)-free graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/19/2020

Independent sets in (P_4+P_4,Triangle)-free graphs

The Maximum Weight Independent Set Problem (WIS) is a well-known NP-hard...
research
11/15/2019

Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles

The weighted T-free 2-matching problem is the following problem: given a...
research
12/31/2020

A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs – via half-edges

We consider three variants of the problem of finding a maximum weight re...
research
03/26/2019

On the tractability of the maximum independent set problem

The maximum independent set problem is a classical NP-complete problem i...
research
01/07/2018

A tractable class of binary VCSPs via M-convex intersection

A binary VCSP is a general framework for the minimization problem of a f...
research
01/31/2022

The road problem and homomorphisms of directed graphs

We make progress on a generalization of the road (colouring) problem. Th...
research
04/23/2015

Graphical Fermat's Principle and Triangle-Free Graph Estimation

We consider the problem of estimating undirected triangle-free graphs of...

Please sign up or login with your details

Forgot password? Click here to reset