59 citations · 99 across the 12 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014★ 59 cited
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
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…
cs.DS2012★ 12 cited
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
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, informatics, and many other areas. Although there exist several algor…