Scalable Graph Clustering Using Stochastic Flows: Applications to Community Discovery  thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Scalable Graph Clustering Using Stochastic Flows: Applications to Community Discovery

Published on Sep 14, 20094404 Views

Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of scalability and frag

Related categories