Parallel Algorithms for Finding Large Cliques in Sparse Graphs

Lukas Gianinazzi, Maciej Besta, Yannick Schaffner, Torsten Hoefler. Parallel Algorithms for Finding Large Cliques in Sparse Graphs. In Kunal Agrawal, Yossi Azar, editors, SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6-8 July, 2021. pages 243-253, ACM, 2021. [doi]

Abstract

Abstract is missing.