A linear-time optimal broadcasting algorithm in stars of cliques

DOI10.7155/jgaa.v28i1.2981MaRDI QIDQ6636986

Peter Damaschke

Publication date: 12 November 2024

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

optimal algorithmstar of cliquestelephone broadcast

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
• Optimal algorithms for dissemination of information in some interconnection networks
• Methods and problems of communication in usual networks
• Broadcast Networks of Bounded Degree
• Information Dissemination in Trees
• Parameterized complexity of broadcasting in graphs

This page was built for publication: A linear-time optimal broadcasting algorithm in stars of cliques