59 citations · 99 across the 12 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2013★ 9 cited
Parallel Maximum Clique Algorithms with Applications to Network Analysis and Storage
Ryan A. Rossi, David F. Gleich, Assefaw H. Gebremedhin +1
We propose a fast, parallel maximum clique algorithm for large sparse graphs that is designed to exploit characteristics of social and information networks. The method exhibits a r…
cs.SI2012★ 9 cited
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…