2304 search results - page 292 / 461 » On the Vulnerability of Large Graphs |
162
click to vote
ADHOCNOW
2004
Springer
15 years 12 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
177
click to vote
VLDB
2004
ACM
15 years 12 months ago
2004
ACM
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analy...
151
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
160
click to vote
WADS
1993
Springer
15 years 10 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
187
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...