A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs.
Bruno C. S. NogueiraRian G. S. PinheiroPublished in: Comput. Oper. Res. (2018)
Keyphrases
- maximum weight
- optimal solution
- minimum weight
- massive graphs
- graphics processing units
- bipartite graph
- independent set
- combinatorial optimization
- greedy heuristic
- simulated annealing
- partial order
- np hard
- weighted graph
- community detection
- social networks
- dynamic programming
- main memory
- greedy algorithm
- minimum spanning tree
- reachability queries
- objective function