42 search results - page 4 / 9 » The chords' problem |
SWAT
1994
Springer
13 years 11 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
ICC
2011
IEEE
12 years 7 months ago
2011
IEEE
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...
P2P
2006
IEEE
14 years 1 months ago
2006
IEEE
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
NDSS
2008
IEEE
14 years 1 months ago
2008
IEEE
We study the problem of reliably searching for resources in untrusted peer-to-peer networks, where a significant portion of the participating network nodes may act maliciously to...