Optimal point-to-point broadcast algorithms via lopsided trees

DOI10.1016/S0166-218X(99)00107-9zbMATH Open1031.90006MaRDI QIDQ1296579FDOQ1296579

Assaf Schuster, Mordecai J. Golin

Publication date: 18 February 2004

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

zbMATH Keywords

networksbroadcast algorithmslopsided

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Parallel algorithms in computer science (68W10) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Cites Work

• A survey of gossiping and broadcasting in communication networks
• Optimal multiple message broadcasting in telephone-like communication systems
• Broadcasting multiple messages in simultaneous send/receive systems
• Designing broadcasting algorithms in the postal model for message-passing systems
• Title not available (Why is that?)
• Recurrence relations based on minimization
• An Elementary Approach to Some Analytic Asymptotics
• A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
• Optimum lopsided binary trees
• Title not available (Why is that?)
• Optimal computation of census functions in the postal model
• Multiple message broadcasting in the postal model

Cited In (4)

• Designing broadcasting algorithms in the postal model for message-passing systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• On searching strategies, parallel questions, and delayed answers

   Recommendations

• Optimal Linear Broadcast 👍 👎
• Optimal broadcast for fully connected processor-node networks 👍 👎
• Optimal and near-optimal algorithms for \(k\)-item broadcast 👍 👎
• An optimal algorithm for broadcasting multiple messages in trees 👍 👎

This page was built for publication: Optimal point-to-point broadcast algorithms via lopsided trees

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