549 search results - page 6 / 110 » Computing All the Best Swap Edges Distributively |
ENTCS
2007
14 years 9 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
109
click to vote
WDAG
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
WDAG
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
NCA
2007
IEEE
15 years 3 months ago
2007
IEEE
The advent of the mobile Web and the increasing demand for personalized contents arise the need for computationally expensive services, such as dynamic generation and on-thefly a...
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...