A Linear-Time Optimal Broadcasting Algorithm in Stars of Cliques
Artikel i vetenskaplig tidskrift, 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

Författare

Peter Damaschke

Chalmers, Data- och informationsteknik, Data Science och AI

Journal of Graph Algorithms and Applications

1526-1719 (ISSN)

Vol. 28 1 385-388

Ämneskategorier

Data- och informationsvetenskap

Fundament

Grundläggande vetenskaper

DOI

10.7155/jgaa.v28i1.2981

Mer information

Skapat

2024-10-24