Sublinear Fully Distributed Partition with ...
Document type :
Article dans une revue scientifique
Title :
Sublinear Fully Distributed Partition with Applications
Author(s) :
Derbel, Bilel [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Mosbah, Mohamed [Auteur]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Zemmari, Akka [Auteur]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Mosbah, Mohamed [Auteur]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Zemmari, Akka [Auteur]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Journal title :
Theory of Computing Systems
Pages :
368-404
Publisher :
Springer Verlag
Publication date :
2010
ISSN :
1432-4350
HAL domain(s) :
Informatique [cs]/Autre [cs.OH]
English abstract : [en]
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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://api.istex.fr/ark:/67375/VQC-7MV4LGLJ-F/fulltext.pdf?sid=hal
- Open access
- Access the document
- https://api.istex.fr/ark:/67375/VQC-7MV4LGLJ-F/fulltext.pdf?sid=hal
- Open access
- Access the document
- https://api.istex.fr/ark:/67375/VQC-7MV4LGLJ-F/fulltext.pdf?sid=hal
- Open access
- Access the document
- https://api.istex.fr/ark:/67375/VQC-7MV4LGLJ-F/fulltext.pdf?sid=hal
- Open access
- Access the document