59 citations · 66 across the 2 of their papers we have counts for
2 papers
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.DC2012★ 7 cited
Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures
Umit Catalyurek, John Feo, Assefaw Gebremedhin +2
We explore the interplay between architectures and algorithm design in the context of shared-memory platforms and a specific graph problem of central importance in scientific and h…