1. Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999). The maximum clique problem. In P. M. Pardalos, D.-Z. Du, & R. L. Graham (Eds.), Handbook of Combinatorial Optimization (pp. 1–74). Boston: Springer.
2. Wu, Q., & Hao, J.-K. (2015). A review on algorithms for maximum clique problems. European Journal of Operational Research, 242, 693–709.
3. Kriegel, H.-P., Kröger, P., Sander, J., & Zimek, A. (2011). Density-based clustering. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 1, 231–240.
4. Campello, R. J., Kröger, P., Sander, J., & Zimek, A. (2020). Density-based clustering. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 10(2), 1343.
5. Abello, J., Resende, M., & Sudarsky, S. (2002). Massive quasi-clique detection. In J. Abello & J. Vitter (Eds.), Proceedings of the 5th Latin American Symposium on the Theory of Informatics. Lecture Notes in Computer Science (Vol. 2286, pp. 598–612). Berlin: Springer.