Sublinear Fully Distributed Partition with Applications

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 model of compu...

Full description

Saved in:
Bibliographic Details
Published in:Theory of computing systems Vol. 47; no. 2; pp. 368 - 404
Main Authors: Derbel, Bilel, Mosbah, Mohamed, Zemmari, Akka
Format: Journal Article
Language:English
Published: New York Springer-Verlag 01.08.2010
Springer Nature B.V
Springer Verlag
Subjects:
Algorithms
Clusters
Computation
Computer Science
Construction
Decomposition
Distributed processing
Graphs
Messages
Neighborhoods
Networks
Other
Sparsity
Synchronizers
Theory of Computation
Sparse partition
Distributed model
Graph spanner
Time complexity
Distributed algorithm
ISSN:1432-4350, 1433-0490
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 model of computation, i.e., limited message size, which improves the time complexity of previous algorithms (Moran and Snir in Theor. Comput. Sci. 243(1–2):217–241, 2000 ; Awerbuch in J. ACM 32:804–823, 1985 ; Peleg in Distributed Computing: A Locality-Sensitive Approach, 2000 ) 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 model.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-009-9190-x