Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time

The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n3/2 ) edge 3-spanner for it in O(log n) time. This algorithm is then extended into a deterministic algorithm for computing an O(kn1+1/k ) edge O(k)-spanner in O(logk−1

• Type: Conference
• Year: 2007
• Where: WDAG
• Authors: Bilel Derbel, Cyril Gavoille, David Peleg
• Keywords: Algorithms, Deterministic Algorithm, Deterministic Distributed Algorithm, Node Unweighted Graph, WDAG 2007