BibTeX
CSL-JSON
MLA
Harvard
Finding Communities in Linear Time: A Physics Approach
release_2kzobdndx5caln77l22ayernaa
by
Fang Wu, Bernardo A. Huberman
Released
as a article
.
2003
Abstract
We present a method that allows for the discovery of communities within
graphs of arbitrary size in times that scale linearly with their size. This
method avoids edge cutting and is based on notions of voltage drops across
networks that are both intuitive and easy to solve regardless of the complexity
of the graph involved. We additionally show how this algorithm allows for the
swift discovery of the community surrounding a given node without having to
extract all the communities out of a graph.
In text/plain
format
Archived Files and Locations
application/pdf 172.6 kB
file_54gmigzorrb45coxuyzpgrhbku
|
archive.org (archive) core.ac.uk (web) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
cond-mat/0310600v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links