Minimum-cost line broadcast in paths

DOI10.1016/S0166-218X(97)00097-8zbMath0883.90059MaRDI QIDQ1363771

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

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

Related Items (3)

Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees ⋮ Minimum-cost line broadcast in paths ⋮ Efficient line broadcasting in a \(d\)-dimensional grid

Cites Work

• Unnamed Item
• Optimal algorithms for dissemination of information in generalized communication modes
• Minimum-cost line broadcast in paths
• Line broadcasting in cycles
• Optimal fully adaptive minimal wormhole routing for meshes
• Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
• Minimum-time line broadcast networks
• Optimal Linear Broadcast
• Linear broadcast routing
• An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes

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