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 , Laboratoire I3S - 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.
Document type :
Reports
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/inria-00288304
Contributor : Florian Huc <>
Submitted on : Friday, June 27, 2008 - 12:01:04 PM
Last modification on : Monday, September 9, 2019 - 1:42:09 PM
Long-term archiving on : Thursday, September 23, 2010 - 5:16:01 PM

Files

disc.pdf
Files produced by the author(s)

Identifiers

  • 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⟩

Share

Metrics

Record views

760

Files downloads

1025