Maximum Independent Sets in Subcubic Graphs: New Results

10/25/2018
by   Ararat Harutyunyan, et al.
0

The maximum independent set problem is known to be NP-hard in the class of subcubic graphs, i.e. graphs of vertex degree at most 3. We present a polynomial-time solution in a subclass of subcubic graphs generalizing several previously known results.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
08/09/2017

On Maximum Common Subgraph Problems in Series-Parallel Graphs

The complexity of the maximum common connected subgraph problem in parti...
research
01/31/2020

Ultimate greedy approximation of independent sets in subcubic graphs

We study the approximability of the maximum size independent set (MIS) p...
research
04/30/2020

Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis

We study the problem of learning the structure of an optimal Bayesian ne...
research
04/15/2020

An algorithmic framework for colouring locally sparse graphs

We develop an algorithmic framework for graph colouring that reduces the...
research
09/13/2021

On explicit reductions between two purely algebraic problems: MQ and MLD

The Maximum Likelihood Decoding Problem (MLD) and the Multivariate Quadr...
research
04/08/2019

From independent sets and vertex colorings to isotropic spaces and isotropic decompositions

In the 1970's, Lovász built a bridge between graphs and alternating matr...

Please sign up or login with your details

Forgot password? Click here to reset