Computing communities in large networks using random walks.
Pons, Pascal; Latapy, Matthieu
Journal of Graph Algorithms and Applications (2006)
- Volume: 10, Issue: 2, page 191-218
- ISSN: 1526-1719
Access Full Article
topHow to cite
topPons, Pascal, and Latapy, Matthieu. "Computing communities in large networks using random walks.." Journal of Graph Algorithms and Applications 10.2 (2006): 191-218. <http://eudml.org/doc/55419>.
@article{Pons2006,
author = {Pons, Pascal, Latapy, Matthieu},
journal = {Journal of Graph Algorithms and Applications},
keywords = {community structure of a network; Walktrap},
language = {eng},
number = {2},
pages = {191-218},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Computing communities in large networks using random walks.},
url = {http://eudml.org/doc/55419},
volume = {10},
year = {2006},
}
TY - JOUR
AU - Pons, Pascal
AU - Latapy, Matthieu
TI - Computing communities in large networks using random walks.
JO - Journal of Graph Algorithms and Applications
PY - 2006
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 10
IS - 2
SP - 191
EP - 218
LA - eng
KW - community structure of a network; Walktrap
UR - http://eudml.org/doc/55419
ER -
Citations in EuDML Documents
topNotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.