A distributed algorithm for computing and updating the process number of a forest

David Coudert 1 Florian Huc 1 Dorian Mazauric 1
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pathwidth. This algorithm requires n steps, an overall computation time of O(n log(n)), and n messages of size log_3(n)+3. We then propose a distributed algorithm to update the process number (or the node search number, or the edge search number) of each component of a forest after adding or deleting an edge. This second algorithm requires O(D) steps, an overall computation time of O(D log(n)), and O(D) messages of size log_3(n)+3, where D is the diameter of the modified connected component. Finally, we show how to extend our algorithms to trees and forests of unknown size using messages of less than 2a+4+e bits, where a is the parameter to be determined and e=1 for updates algorithms.
Type de document :
Rapport
[Research Report] RR-6560, INRIA. 2008
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00288304
Contributeur : Florian Huc <>
Soumis le : vendredi 27 juin 2008 - 12:01:04
Dernière modification le : lundi 23 avril 2018 - 10:52:05
Document(s) archivé(s) le : jeudi 23 septembre 2010 - 17:16:01

Fichiers

disc.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00288304, version 3
  • ARXIV : 0806.2710

Citation

David Coudert, Florian Huc, Dorian Mazauric. A distributed algorithm for computing and updating the process number of a forest. [Research Report] RR-6560, INRIA. 2008. 〈inria-00288304v3〉

Partager

Métriques

Consultations de la notice

531

Téléchargements de fichiers

659