Line broadcasting in cycles

DOI10.1016/S0166-218X(97)00111-XzbMath0907.90136OpenAlexW2091361607WikidataQ127068297 ScholiaQ127068297MaRDI QIDQ1392536

Jave O. Kane, Joseph G. Peters

Publication date: 28 July 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

broadcasting in cyclesline broadcast scheme

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Applications of graph theory to circuits and networks (94C15)

Related Items (7)

Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees ⋮ Minimum-cost line broadcast in paths ⋮ Broadcast and gossip in line-communication mode ⋮ Line broadcasting in cycles ⋮ All-to-all broadcast problem of some classes of graphs under the half duplex all-port model ⋮ All-to-all broadcast problems on Cartesian product graphs ⋮ Efficient line broadcasting in a \(d\)-dimensional grid

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal algorithms for dissemination of information in generalized communication modes
• Methods and problems of communication in usual networks
• Line broadcasting in cycles
• Minimum-time line broadcast networks
• Antepenultimate broadcasting

This page was built for publication: Line broadcasting in cycles