2 search results - page 1 / 1 » Sparse Hypercube: A Minimal k-Line Broadcast Graph |
IPPS
1999
IEEE
13 years 8 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
SIGAL
1990
13 years 8 months ago
1990
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...