Skip to Main content Skip to Navigation
Journal articles

Sublinear Fully Distributed Partition with Applications

Abstract : We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with $n$ nodes into a disjoint set of connected clusters with radius at most $k-1$ and having $O(n^{1+1/k})$ intercluster edges. We show how to implement our algorithms in the distributed $\mathcal{CONGEST}$ model of computation, i.e., limited message size, which improves the time complexity of previous algorithms~\cite{MS00,Awe85,Peleg00b} from $O(n)$ to $O(n^{1-1/k})$. We apply our algorithms for constructing low stretch graph spanners and network synchronizers in sublinear deterministic time in the $\mathcal{CONGEST}$ model.
Complete list of metadatas
Contributor : Akka Zemmari <>
Submitted on : Thursday, January 8, 2009 - 11:53:37 AM
Last modification on : Saturday, March 14, 2020 - 5:50:12 PM

Links full text



Bilel Derbel, Mohamed Mosbah, Akka Zemmari. Sublinear Fully Distributed Partition with Applications. Theory of Computing Systems, Springer Verlag, 2010, 47 (3), pp.368-404. ⟨10.1007/s00224-009-9190-x⟩. ⟨hal-00351045⟩



Record views