A linear-time optimal broadcasting algorithm in stars of cliques

DOI10.7155/JGAA.V28I1.2981MaRDI QIDQ6636986zbMATH OpenFDO

Authors Peter Damaschke

Publication date 12 November 2024

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/JGAA.V28I1.2981

zbMATH Keywords

optimal algorithmstar of cliquestelephone broadcast

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(2)

• Broadcasting under structural restrictions
• On the complexity of telephone broadcasting from cacti to bounded pathwidth graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636986)