Distributed algorithms for ultrasparse spanners and linear size skeletons

DOI10.1145/1400751.1400786zbMath1301.68259OpenAlexW2032654248MaRDI QIDQ5892001

Seth Pettie

Publication date: 12 December 2014

Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1400751.1400786

zbMATH Keywords

spanner

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Sublinear fully distributed partition with applications ⋮ Graph spanners: a tutorial review

This page was built for publication: Distributed algorithms for ultrasparse spanners and linear size skeletons