1. Gibson D, Kumar R, Tomkins A (2005) Discovering large dense subgraphs in massive graphs. In: Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 2, 2005, pp. 721–732 http://www.vldb.org/archives/website/2005/program/paper/thu/p721-gibson.pdf
2. Qin L, Li R, Chang L, Zhang C (2015) Locally densest subgraph discovery. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Sydney, NSW, Australia, August 10-13, 2015, pp. 965–974 https://doi.org/10.1145/2783258.2783299
3. Modani N, Dey K (2009) Large maximal cliques enumeration in large sparse graphs. In: Chawla, S., Karlapalem, K., Pudi, V. (eds.) Proceedings of the 15th International Conference on Management of Data, December 9-12, 2009, International School of Information Management, Mysore, India. Computer Society of India, India. http://www.cse.iitb.ac.in/%7Ecomad/2009/proceedings/R3_1.pdf
4. Makino K, Uno T (2004) New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings. Lecture Notes in Computer Science, vol. 3111, pp. 260–272. Springer, Germany. https://doi.org/10.1007/978-3-540-27810-8_23
5. Mukherjee AP, Xu P, Tirthapura S (2015) Mining maximal cliques from an uncertain graph. In: 31st IEEE International Conference on Data Engineering, ICDE 2015, Seoul, South Korea, April 13-17, 2015, pp. 243–254. https://doi.org/10.1109/ICDE.2015.7113288