723 search results - page 90 / 145 » On the hyperbolicity constant in graphs |
144
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) ...
162
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
161
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
187
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
144
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...