1. [n.d.]. The Network Data Repository with Interactive Graph Analytics and Visualization Vol. 29. https://ojs.aaai.org/index.php/AAAI/article/view/9277
2. The Enumeration of Maximal Cliques of Large Graphs
3. Parallel K-clique counting on GPUs
4. Ricardo Baeza-Yates and Alejandro Salinger. 2010. Fast intersection algorithms for sorted sequences. Algorithms and Applications: Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday (2010), 45–61.
5. Jon Louis Bentley and Andrew Chi-Chih Yao. 1976. An almost optimal algorithm for unbounded searching. Information processing letters 5, SLAC-PUB-1679 (1976).