A scalable multilevel algorithm for graph clustering and community structure detection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4936 LNCS, Issue , 2008, Pages 117-128

  Djidjev, Hristo N ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHLORINE COMPOUNDS; FLOW OF SOLIDS; GRAPH THEORY;

CLUSTER QUALITY; CLUSTERINGS; COMMUNITY STRUCTURES; COMPLETE GRAPHS; GRAPH CLUSTERING; GRAPH G; GRAPH PARTITIONING; MINIMUM CUTS; MULTILEVEL ALGORITHMS;

CLUSTERING ALGORITHMS;

EID: 49049115562     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78808-9_11     Document Type: Conference Paper

References (20)

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
2. Albert, R., Jeong, H., Barabási, A.L.: Diameter of the World Wide Web. Nature 401, 130 (1999)
3. Barabási, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509-512 (1999)
4. Barnard, S.T., Simon, H.D.: A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience 6, 101-107 (1994)
5. Chung, F., Lu, L.: Connected components in random graphs with given degree sequences. Annals of Combinatorics 6, 125-145 (2002)
6. Clauset, A., Newman, M., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004)
7. Erdos, P., Renyi, A.: On random graphs. Publicationes Mathematicae 6, 290-297 (1959)
8. Fiduccia, C.M., Mattheyses, R.M.: A linear time heuristic for improving network partitions. IEEE Design Automation Conference, 175-181 (1982)
9. Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph Clustering and Minimum Cut Trees. Internet Mathematics 1, 385-408 (2004)
10. Hendrickson, B., Leland, R.: A Multilevel Algorithm for Partitioning Graphs. In: ACM/IEEE conference on Supercomputing (1995)
11. Girvan, M., Newman, M.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821-7826 (2002)
12. Karypis, G., Kumar, V.: Multilevel graph partitioning schemes. In: International Conference on Parallel Processing, pp. 113-122 (1995)
13. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20(1), 359-392 (1999)
14. Kerninghan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal (1970)
15. Newman, M.: Fast algorithm for detecting community structure in networks, Phys. Phys. Rev. E 69, 066133 (2004)
16. Newman, M.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006)
17. Newman, M.: Mixing patterns in networks. Phys. Rev. E 67, 026126 (2003)
18. Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)
19. White, S., Smyth, P.: A Spectral Clustering Approach to Finding Communities in Graphs. In: Proceedings of the SIAM International Conference on Data Mining (2005)
20. Zachary, W.W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33, 452-473 (1977)