An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs.
Mingyu XiaoHiroshi NagamochiPublished in: FAW-AAIM (2013)
Keyphrases
- maximum independent set
- graph theory
- graph theoretic
- independent set
- random graphs
- social network analysis
- branch and bound algorithm
- integer programming
- shortest path problem
- special case
- clustering coefficient
- column generation
- exact algorithms
- graph mining
- graph matching
- dynamic programming
- computational complexity