Some Complexity Results for Matrix Computations on Parallel Processors
Journal of the ACM (JACM)
A data structure for manipulating priority queues
Communications of the ACM
Reverse path forwarding of broadcast packets
Communications of the ACM
Algorithms on trees and maximal outerplanar graphs: design, complexity analysis, and data structures study.
Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks
IEEE Transactions on Computers
Trade-offs between the size of advice and broadcasting time in trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Pipelined broadcast on ethernet switched clusters
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Population structure and artificial evolution
EA'05 Proceedings of the 7th international conference on Artificial Evolution
| Hi-index | 14.98 |
"Broadcasting" is an information dissemination process in which a member of a system generates a message communicated to all other members. We model this process by ordered rooted trees and investigate a special class of rooted trees allowing broadcasting from the root to all other vertices of the tree in the minimum time (over all rooted trees with n vertices). We characterize trees from this class ("mbt") and give an algorithm deciding membership in the class. We also present an algorithm to construct all mbt's with a given number of vertices and give a recursive formula to count these trees.