Spanners and message distribution in networks.

DOI10.1016/S0166-218X(03)00259-2zbMath1062.68085MaRDI QIDQ1427197

Daniel Zappala, Arthur M. Farley, Andrzej Proskurowski, Kurt Windisch

Publication date: 14 March 2004

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

zbMATH Keywords

SimulationNetworksGraphBroadcast\(k\)-spannerFlooding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)

Related Items (6)

Sparse geometric graphs with small dilation ⋮ Multipath Spanners via Fault-Tolerant Spanners ⋮ Constructing Light Spanners Deterministically in Near-Linear Time ⋮ Constructing light spanners deterministically in near-linear time ⋮ Shortcut sets for the locus of plane Euclidean networks ⋮ Fault tolerant additive and \((\mu, \alpha)\)-spanners

Cites Work

• A fast algorithm for Steiner trees
• NP-completeness of minimum spanner problems
• Steiner problem in networks: A survey
• An Optimal Synchronizer for the Hypercube
• Tree Spanners
• Unnamed Item
• Unnamed Item

This page was built for publication: Spanners and message distribution in networks.