A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs
Author:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 491-501
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Counting models for 2SAT and 3SAT formulaeTheoretical Computer Science, 2005
- Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard ProblemsLecture Notes in Computer Science, 2003
- Algorithms for maximum independent setsJournal of Algorithms, 1986
- An O(20.304n) Algorithm for Solving Maximum Independent Set ProblemIEEE Transactions on Computers, 1986
- Finding a Maximum Independent SetSIAM Journal on Computing, 1977