Sciweavers

882 search results - page 177 / 177
» On the Hardness of Graph Isomorphism
Sort
View
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
11 years 10 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
SPAA
2010
ACM
14 years 8 days ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...