A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components
Ryan A. Rossi(Adobe Systems (United States)), Md. Mostofa Ali Patwary(Intel (United Kingdom)), Assefaw H. Gebremedhin(Washington State University), David F. Gleich(Purdue University West Lafayette)
Purdue e-Pubs (Purdue University System)
February 25, 2013
Cited by 32
Related Papers
The Network Data Repository with Interactive Graph Analytics and Visualization
|Proceedings of the AAAI Conference on Artificial Intelligence|2015|2.5k
Bias and Fairness in Large Language Models: A Survey
|Computational Linguistics|2024|583
Continuous-Time Dynamic Network Embeddings
|Unknown|2018|549
GraphMat
|Proceedings of the VLDB Endowment|2015|292
Graph Classification using Structural Attention
|Unknown|2018|290