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]
@inproceedings{GianinazziBSH21,
title = {Parallel Algorithms for Finding Large Cliques in Sparse Graphs},
author = {Lukas Gianinazzi and Maciej Besta and Yannick Schaffner and Torsten Hoefler},
year = {2021},
doi = {10.1145/3409964.3461800},
url = {https://doi.org/10.1145/3409964.3461800},
researchr = {https://researchr.org/publication/GianinazziBSH21},
cites = {0},
citedby = {0},
pages = {243-253},
booktitle = {SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6-8 July, 2021},
editor = {Kunal Agrawal and Yossi Azar},
publisher = {ACM},
isbn = {978-1-4503-8070-6},
}