A Linear-Time Optimal Broadcasting Algorithm in Stars of Cliques
Journal article, 2024

For the telephone broadcast model, an O(n log n)-time algorithm for constructing an optimal broadcasting scheme in a star of cliques with a total of vertices was recently presented by Ambashankar and Harutyunyan at IWOCA 2024. In the present note we give a considerably shorter and purified algorithm description and correctness proof. Moreover, we improve the time complexity to O(n).

telephone broadcast

optimal algorithm

star of cliques

Author

Peter Damaschke

Chalmers, Computer Science and Engineering (Chalmers), Data Science and AI

Journal of Graph Algorithms and Applications

1526-1719 (ISSN)

Vol. 28 1 385-388

Subject Categories

Computer and Information Science

Roots

Basic sciences

DOI

10.7155/jgaa.v28i1.2981

More information

Created

10/24/2024