1. Goldberg, A. (1984). Finding a Maximum Density Subgraph, Technical Report UCB/CSB 84/171, Department of Electrical Engineering and Computer Science, University of California.
2. Gibson, D., Kleinberg, J., and Raghavan, P. (1998, January 20–24). Inferring web communities from Web topology. Proceedings of the Ninth ACM Conference on Hypertext and Hypermedia: Links, Objects, Time and Space—Structure in Hypermedia Systems, Pittsburgh, PA, USA.
3. Gibson, D., Kumar, R., and Tomkins, A. (September, January 30). Discovering large dense subgraphs in massive graphs. Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway.
4. Mining coherent dense subgraphs across massive biological networks for functional discovery;Hu;Bioinformatics,2005
5. Kleinberg, J. (1998, January 25–27). Authoritative sources in hypertext linked environments. Proceedings of the 9th Annual ACM–SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA.