Fast Deterministic Distributed Algorithms for Sparse Spanners

DOI10.1007/11780823_9zbMath1222.68410OpenAlexW2177203569MaRDI QIDQ3613647

Bilel Derbel, Cyril Gavoille

Publication date: 12 March 2009

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780823_9

zbMATH Keywords

graph spannersdeterministic algorithmstime complexitydistributed algorithmsLinial's free model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (3)

Derandomizing local distributed algorithms under bandwidth restrictions ⋮ Local Maps: New Insights into Mobile Agent Algorithms ⋮ Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set

This page was built for publication: Fast Deterministic Distributed Algorithms for Sparse Spanners