Minimum-cost line broadcast in paths

DOI10.1016/S0166-218X(97)00097-8MaRDI QIDQ1363771zbMATH OpenFDO

Authors Satoshi Fujita, Arthur M. Farley

Publication date 11 August 1997

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

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

zbMATH Keywords

line communication protocoloptimal, line broadcast scheme

Mathematics Subject Classification ID

Paths and cycles (05C38) Communication networks in operations research (90B18) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees
• Minimal-Time k-Line Broadcasting
• Line broadcasting in cycles
• Broadcast networks with near optimal cost

Cites work

• scientific article; zbMATH DE number 1256694 (Why is no real title available?)
• An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
• Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
• Line broadcasting in cycles
• Linear broadcast routing
• Minimum-cost line broadcast in paths
• Minimum-time line broadcast networks
• Optimal Linear Broadcast
• Optimal algorithms for dissemination of information in generalized communication modes
• Optimal fully adaptive minimal wormhole routing for meshes

Cited in

(5)

• Minimum-cost line broadcast in paths
• Short-length routes in low-cost networks via Poisson line patterns
• Minimum cost path problems with relays
• Efficient line broadcasting in a \(d\)-dimensional grid
• Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees

This page was built for publication: Minimum-cost line broadcast in paths

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