Maximum independent sets in graphs of low degree

Authors:
Vadim Lozin;Martin Milanič
Affiliations:
Rutgers University, Piscat-away NJ;Rutgers University, Piscataway NJ
Venue:
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2007

Citing 8
Cited 1

Easy problems for tree-decomposable graphs

Journal of Algorithms
Computing independent sets in graphs with large girth

Discrete Applied Mathematics
On the stability number of AH-free graphs

Journal of Graph Theory
Treewidth for graphs with small chordality

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Independent Sets in Asteroidal Triple-Free Graphs

SIAM Journal on Discrete Mathematics
Polynomial algorithm for finding the largest independent sets in graphs without forks

Discrete Applied Mathematics
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On clique separators, nearly chordal graphs, and the maximum weight stable set problem

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

The Maximum Independent Set Problem in Planar Graphs

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study computational complexity of the maximum independent set problem on graphs of bounded vertex degree. In general, this problem is NP-hard. However, under certain restrictions it becomes polynomial-time solvable. We identify three graph properties to which the complexity of the problem is sensible.