A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs.
Martin FürerPublished in: LATIN (2006)
Keyphrases
- preprocessing
- times faster
- worst case
- learning algorithm
- k means
- np hard
- experimental evaluation
- dynamic programming
- computational cost
- optimization algorithm
- memory efficient
- random graphs
- minimum spanning tree
- recognition algorithm
- expectation maximization
- cost function
- optimal solution
- objective function
- similarity measure
- linear programming
- computational complexity
- graph partitioning