59 citations · 59 across the 1 of their papers we have counts for
1 paper
Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin +2
The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, information retrieval and many other areas related to the World Wide…