Finding maximum independent sets in sparse and general graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Vertex cover: further observations and further improvements
Journal of Algorithms
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
A new approach to proving upper bounds for MAX-2-SAT
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
3-Hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Further improvement on maximum independent set in degree-4 graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
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
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
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we propose an O(1.0892^n) algorithm solving the Maximum Independent Set problem for graphs with maximum degree 3 improving the previously best upper bound of O(1.0977^n). A useful secondary effect of the proposed algorithm is that being applied to 2k kernel, it improves the upper bound on the parameterized complexity of the Vertex Cover problem for graphs with maximum degree 3 (VC-3). In particular, the new upper bound for the VC-3 problem is O(1.1864^k+n), improving the previously best upper bound of O(k^2*1.194^k+n). The presented results have a methodological interest because, to the best of our knowledge, this is the first time when a new parameterized upper bound is obtained through design and analysis of an exact exponential algorithm.