Sciweavers

63 search results - page 13 / 13
» Random Graph Coverings I: General Theory and Graph Connectiv...
Sort
View
PODC
2005
ACM
16 years 1 days ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
BMCBI
2006
144views more  BMCBI 2006»
15 years 6 months ago
Development and implementation of an algorithm for detection of protein complexes in large interaction networks
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry e...
Md. Altaf-Ul-Amin, Yoko Shinbo, Kenji Mihara, Ken ...
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
13 years 9 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