Minimal-Time k-Line Broadcasting

DOI10.1137/S0895480101386620zbMATH Open1078.90016OpenAlexW2008762677MaRDI QIDQ5317586FDOQ5317586

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

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

zbMATH Keywords

\(k\)-line broadcasting

Mathematics Subject Classification ID

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

Cited In (11)

• All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
• Minimum-time multidrop broadcast
• Title not available (Why is that?)
• Title not available (Why is that?)
• All-port line broadcasting in highly connected graphs
• Line-broadcasting in complete \(k\)-ary trees
• All-to-all broadcast problems on Cartesian product graphs
• Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees
• An optimal algorithm for broadcasting multiple messages in trees
• Optimal Linear Broadcast
• \(k\)-port line broadcasting in trees

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)