225 search results - page 28 / 45 » Stably Computable Properties of Network Graphs |
144
click to vote
ISPA
2004
Springer
15 years 6 months ago
2004
Springer
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
122
Voted
SDM
2009
SIAM
15 years 10 months ago
2009
SIAM
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
101
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
122
click to vote
ICDCS
2002
IEEE
15 years 5 months ago
2002
IEEE
The need for sharing is well known in a large number of distributed collaborative applications. These applications are difficult to develop for wide area (possibly mobile) networ...
113
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...