A simple and fast algorithm for maximum independent set in 3-degree graphs

Authors:
Mingyu Xiao
Affiliations:
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
Venue:
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Year:
2010

Citing 8
Cited 11

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
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems

Algorithmica
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
An O*(1.0977n) exact algorithm for MAX INDEPENDENT SET in sparse graphs

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A faster algorithm for finding maximum independent sets in sparse graphs

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

A note on vertex cover in graphs with maximum degree 3

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Exact and parameterized algorithms for edge dominating set in 3-degree graphs

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Parameterized edge dominating set in cubic graphs

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Further improvement on maximum independent set in degree-4 graphs

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
New parameterized algorithms for the edge dominating set problem

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the independence number of graphs with maximum degree 3

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
A refined exact algorithm for edge dominating set

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs

Theoretical Computer Science
On the independence number of graphs with maximum degree 3

Theoretical Computer Science
Parameterized edge dominating set in graphs with degree bounded by 3

Theoretical Computer Science
New parameterized algorithms for the edge dominating set problem

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple O*(1.0885n)-time algorithm for finding a maximum independent set in an n-vertex graph with degree bounded by 3, which improves most previous running time bounds obtained with far more complicated algorithms. In this paper, we use a nontraditional measure to analyze the problem size and some uniform branching rules to avoid tedious case analysis. Those techniques help us to design simple and fast algorithms with moderately complicated analysis.