Further improvement on maximum independent set in degree-4 graphs

Authors:
Mingyu Xiao;Hiroshi Nagamochi
Affiliations:
School of Computer Science and Engineering, University of Electronic Science and Technology of China, China;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan
Venue:
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Year:
2011

Citing 13
Cited 1

An O(20.304n) Algorithm for Solving Maximum Independent Set Problem

IEEE Transactions on Computers
Finding maximum independent sets in sparse and general graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Quasiconvex analysis of backtracking algorithms

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Measure and conquer: a simple O(20.288n) independent set algorithm

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3

Journal of Discrete Algorithms
Pathwidth of cubic graphs and exact algorithms

Information Processing Letters
Improved upper bounds for vertex cover

Theoretical Computer Science
Maximum independent set in graphs of average degree at most three in O(1.08537n)

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A bottom-up method and fast algorithms for MAX INDEPENDENT SET

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Linear kernels in linear time, or how to save k colors in O(n2) steps

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
A simple and fast algorithm for maximum independent set in 3-degree graphs

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
A faster algorithm for finding maximum independent sets in sparse graphs

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple algorithm for the maximum independent set problem in an n-vertex graph with degree bounded by 4, which runs in O*(1.1526n) time and improves all previous algorithms for this problem. In this paper, we use the "Measure and Conquer method" to analyze the running time bound, and use some good reduction and branching rules to avoid tedious checking on a large number of local structures.