549 search results - page 17 / 110 » Computing All the Best Swap Edges Distributively |
PODC
2012
ACM
13 years 1 days ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
GD
2004
Springer
15 years 3 months ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
SIGMETRICS
2008
ACM
14 years 9 months ago
2008
ACM
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...