1. Optimal Broadcasting in Fully Connected Trees.
- Author
-
Gholami, Saber, Harutyunyan, Hovhannes A., and Maraachlian, Edward
- Subjects
- *
BROADCASTING industry , *TREES , *COMPLETE graphs , *GRAPH theory - Abstract
Broadcasting is disseminating information in a network where a specific message must spread to all network vertices as quickly as possible. Finding the minimum broadcast time of a vertex in an arbitrary network is proven to be NP-complete. However, this problem is solvable for a few families of networks. In this paper, we present an optimal algorithm for finding the broadcast time of any vertex in a fully connected tree ( FCT n ) in O (| V | log log n) time. An FCT n is formed by attaching arbitrary trees to vertices of a complete graph of size n where | V | is the total number of vertices in the graph. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF