Linear Algorithm for Broadcasting in Unicyclic Graphs
From MaRDI portal
Publication:3608862
DOI10.1007/978-3-540-73545-8_37zbMath1206.68236OpenAlexW1568102860MaRDI QIDQ3608862
Edward Maraachlian, Hovhannes A. Harutyunyan
Publication date: 6 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_37
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
The complexity of finding a broadcast center ⋮ Broadcasting in split graphs ⋮ Approximation algorithms in graphs with known broadcast time of the base graph ⋮ On broadcasting in unicyclic graphs
This page was built for publication: Linear Algorithm for Broadcasting in Unicyclic Graphs