1 code implementation • 25 Feb 2013 • Ryan A. Rossi, David F. Gleich, Assefaw H. Gebremedhin, Md. Mostofa Ali Patwary
We propose a fast, parallel maximum clique algorithm for large sparse graphs that is designed to exploit characteristics of social and information networks.
Social and Information Networks Distributed, Parallel, and Cluster Computing Discrete Mathematics Data Structures and Algorithms Physics and Society 05C69 G.2.2
