Local Computation of Nearly Additive Spanners

DOI10.1007/978-3-642-04355-0_20zbMath1261.68165OpenAlexW1515111191MaRDI QIDQ3646224

Laurent Viennot, Cyril Gavoille, Bilel Derbel, David Peleg

Publication date: 19 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04355-0_20

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (7)

Derandomizing local distributed algorithms under bandwidth restrictions ⋮ The sparsest additive spanner via multiple weighted BFS trees ⋮ Distributed construction of purely additive spanners ⋮ Unnamed Item ⋮ Distributed algorithms for ultrasparse spanners and linear size skeletons ⋮ The Sparsest Additive Spanner via Multiple Weighted BFS Trees ⋮ Congested Clique Algorithms for Graph Spanners

This page was built for publication: Local Computation of Nearly Additive Spanners