Further improvement on maximum independent set in degree-4 graphs
M Xiao, H Nagamochi - International Conference on Combinatorial …, 2011 - Springer
M Xiao, H Nagamochi
International Conference on Combinatorial Optimization and Applications, 2011•SpringerWe 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.1526 n) 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.
graph with degree bounded by 4, which runs in O*(1.1526 n) 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.
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.
Springer
Showing the best result for this search. See all results
