Minimal-Time k-Line Broadcasting

DOI10.1137/S0895480101386620MaRDI QIDQ5317586zbMATH OpenOpenAlexFDO

Authors Iris Gaber

Publication date 16 September 2005

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480101386620

zbMATH Keywords

\(k\)-line broadcasting

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Programming involving graphs or networks (90C35)

Recommendations

• Line broadcasting in cycles
• k-port line broadcasting in trees
• Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees
• Multiple message broadcasting in communication networks
• Line-broadcasting in complete k-ary trees

Cited in

(13)

• Minimum-cost line broadcast in paths
• Minimum-time multidrop broadcast
• Line broadcasting in cycles
• An optimal algorithm for broadcasting multiple messages in trees
• k-port line broadcasting in trees
• scientific article; zbMATH DE number 3934937 (Why is no real title available?)
• All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
• Optimal Linear Broadcast
• Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees
• Line-broadcasting in complete k-ary trees
• All-port line broadcasting in highly connected graphs
• scientific article; zbMATH DE number 2089982 (Why is no real title available?)
• All-to-all broadcast problems on Cartesian product graphs

This page was built for publication: Minimal-Time k-Line Broadcasting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317586)