Login / Signup
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
Bharath Pattabiraman
Md. Mostofa Ali Patwary
Assefaw Hadish Gebremedhin
Wei-keng Liao
Alok N. Choudhary
Published in:
CoRR (2012)
Keyphrases
</>
computational cost
graph theory
genetic algorithm
data structure
computational complexity
significant improvement
random graphs
maximum clique
max cut