3708 search results - page 400 / 742 » Approximating Betweenness Centrality |
169
click to vote
IWANN
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. ZARAMIT is an information system capable of fully automated phylogeny reconstruction. Methods have been tailored to mitochondrial DNA sequences, with focus on subproblem ...
158
click to vote
SIROCCO
2010
15 years 8 months ago
2010
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...
185
click to vote
TCS
2008
15 years 6 months ago
2008
Mobile sensors can self-deploy in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which they cover uniformly the enviro...
203
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
171
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—Knowledge of a network’s topology and internal characteristics such as delay times or losses is crucial to maintain seamless operation of network services. Network tomography ...