Finding communities in linear time: A physics approach

European Physical Journal B

Volumn 38, Issue 2, 2004, Pages 331-338

  Wu, F ^a   Huberman, B A ^b  

^a STANFORD UNIVERSITY   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER SCIENCE; ELECTRIC POTENTIAL; GRAPH THEORY; LINEAR SYSTEMS; PROBLEM SOLVING;

COMMUNITY STRUCTURE; GENEALOGICAL TREES; SOCIAL NETWORKS; VOLTAGE DROPS;

COMPUTER NETWORKS;

EID: 2942619068     PISSN: 14346028     EISSN: None     Source Type: Journal    
DOI: 10.1140/epjb/e2004-00125-x     Document Type: Conference Paper

References (13)

1. L. Freeman, Sociometry 40, 35-41 (1977)
2. M.E.J. Newman, M. Girvan, Finding and evaluating community structure in networks, cond-mat/0308217 (2003)
3. M. Girvan, M.E.J. Newman, Proc. Natl. Acad. Sci. USA 99, 8271-8276 (2002)
4. D. Wilkinson, B.A. Huberman, Proc. Natl. Acad. Sci. USA 10, 1073 (2004)
5. J. Tyler, D. Wilkinson, B.A. Huberman, Email as Spectroscopy: Automated Discovery of Community Structure within Organizations, Communities and Technologies, edited by M. Huysman, E. Wegner, V. Wulf (Kluwer Academic, 2003)
6. B. Kernighan, S. Lin, Bell Sys. Techn. J. 29, 291-307 (1970)
7. C. Fiduccia, R. Mattheyses, A linear-time heuristic for improving network partitions, Proceedings of the 19th IEEE Design Automation Conference, 175-181 (1982)
8. A. Pothen, H. Simon, K.P. Liou, SIAM J. Matrix Anal. Appl. 11, 430-452 (1990)
9. M. Fiedler, Czech. Math. J. 23, 298 (1973)
10. M. Fiedler, Czech. Math. J. 25, 619 (1975)
11. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to algorithms, 2nd edn. (MIT Press, 2001), p. 189, p. 168
12. W.W. Zachary, Anthropological Res. 33, 452 (1977)
13. B. Rabinovich, A. Rapoport, Graphs, Geometry and Probability, Lecture 7 (March 2003)