Broadcast networks of bounded degree
SIAM Journal on Discrete Mathematics
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Broadcasting in butterfly and deBruijn networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Approximation Algorithms for Minimum-Time Broadcast
SIAM Journal on Discrete Mathematics
Optimal Information Dissemination in Star and Pancake Networks
IEEE Transactions on Parallel and Distributed Systems
Approximation algorithms for broadcasting and gossiping
Journal of Parallel and Distributed Computing
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized Broadcast in Networks
SIGAL '90 Proceedings of the International Symposium on Algorithms
Random Evolution in Massive Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Implementation of algorithms for maximum matching on nonbipartite graphs.
Implementation of algorithms for maximum matching on nonbipartite graphs.
An efficient heuristic for broadcasting in networks
Journal of Parallel and Distributed Computing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
| Hi-index | 0.00 |
We present here a heuristic for broadcasting and a heuristic for gossiping. These heuristics outperform the previous heuristics in several network generators. The heuristic for gossiping also has a lower time complexity than the best heuristic in practice.