723 search results - page 108 / 145 » On the hyperbolicity constant in graphs |
142
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
185
click to vote
ICDCSW
2009
IEEE
16 years 23 days ago
2009
IEEE
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
168
click to vote
INFOCOM
2009
IEEE
16 years 22 days ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
170
click to vote
CSR
2009
Springer
16 years 20 days ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
151
click to vote
ICDCS
2006
IEEE
16 years 4 days ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...