An efficient heuristic for broadcasting in networks

DOI10.1016/j.jpdc.2005.06.010zbMath1158.68315OpenAlexW2017306767MaRDI QIDQ2369649

Bin Shao, Hovhannes A. Harutyunyan

Publication date: 22 May 2006

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.06.010

zbMATH Keywords

networkalgorithmheuristicbroadcast

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (6)

Tighter bounds on the minimum broadcast time ⋮ Broadcasting on cactus graphs ⋮ A linear algorithm for finding the k‐broadcast center of a tree ⋮ Broadcasting in weighted trees under the postal model ⋮ Rumor spreading with bounded in-degree ⋮ On broadcasting in unicyclic graphs

This page was built for publication: An efficient heuristic for broadcasting in networks