Fast Algorithms for max independent set
Open Access
- 19 October 2010
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 62 (1-2) , 382-415
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$Lecture Notes in Computer Science, 2010
- A measure & conquer approach for the analysis of exact algorithmsJournal of the ACM, 2009
- An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs2008
- On Two Techniques of Combining Branching and TreewidthAlgorithmica, 2007
- Algorithms for Counting 2-Sat Solutions and Colorings with Applications2007
- Pathwidth of cubic graphs and exact algorithmsInformation Processing Letters, 2006
- A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs2006
- Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard ProblemsAlgorithmica, 2005
- Counting models for 2SAT and 3SAT formulaeTheoretical Computer Science, 2005
- Improvement on vertex cover for low-degree graphsNetworks, 2000