59 citations · 99 across the 12 of their papers we have counts for
3 papers · 1 filter
What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks
Ryan A. Rossi, David F. Gleich, Assefaw H. Gebremedhin +1
Exact maximum clique finders have progressed to the point where we can investigate cliques in million-node social and information networks, as well as find strongly connected compo…
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…
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…