10 search results - page 1 / 2 » A Local Graph Partitioning Algorithm Using Heat Kernel Pager... |
WAW
2009
Springer
13 years 12 months ago
2009
Springer
WAW
2007
Springer
13 years 11 months ago
2007
Springer
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
IM
2007
13 years 5 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
WAW
2010
Springer
13 years 3 months ago
2010
Springer
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...