Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees

DOI10.1002/net.1036zbMath0997.94043OpenAlexW1988339278MaRDI QIDQ4537606

Iris Gaber, Amir Z. Averbuch, Yehuda Roditty

Publication date: 1 July 2002

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.1036

zbMATH Keywords

communication networkcomplete binary treesline broadcasting

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory to circuits and networks (94C15) Communication theory (94A05)

Related Items (1)

Efficient line broadcasting in a \(d\)-dimensional grid

Cites Work

• Unnamed Item
• Minimum broadcast graphs
• Minimum-cost line broadcast in paths
• Line broadcasting in cycles
• Minimum-time line broadcast networks

This page was built for publication: Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees