17 search results - page 4 / 4 » Expansion properties of a random regular graph after random ... |
SODA
2008
ACM
13 years 6 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
SRDS
2005
IEEE
13 years 11 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...