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

DOI10.1016/S0166-218X(00)00277-8zbMath0992.68161OpenAlexW1968482872MaRDI QIDQ5951959

Yehuda Roditty, Amir Z. Averbuch, Barack Shoham

Publication date: 11 September 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00277-8

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum broadcast graphs
• Parallel concepts in graph theory
• Broadcasting multiple messages in a grid
• Minimum-cost line broadcast in paths
• On broadcasting multiple messages in a \(d\)-dimensional grid
• Line broadcasting in cycles
• A survey of gossiping and broadcasting in communication networks
• Minimum-time line broadcast networks
• Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees

This page was built for publication: Efficient line broadcasting in a \(d\)-dimensional grid