Exact algorithms for maximum independent set.
Mingyu XiaoHiroshi NagamochiPublished in: Inf. Comput. (2017)
Keyphrases
- exact algorithms
- maximum independent set
- graph theory
- graph theoretic
- independent set
- knapsack problem
- combinatorial optimization
- approximation algorithms
- exact solution
- computational problems
- vehicle routing problem with time windows
- benders decomposition
- combinatorial optimization problems
- neural network
- heuristic methods
- max sat
- combinatorial problems
- greedy algorithm
- complex networks
- social network analysis
- np hard
- network design problem
- social networks