A distributed algorithm for computing and updating the process number of a forest
| dc.creator | Coudert, David | |
| dc.creator | Huc, Florian | |
| dc.creator | Mazauric, Dorian | |
| dc.date | 2008-06-17 | |
| dc.date | 2008-06-27 | |
| dc.date.accessioned | 2026-07-07T12:19:33Z | |
| dc.date.available | 2026-07-07T12:19:33Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0806.2710 | |
| dc.identifier | http://arxiv.org/abs/0806.2710 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/212793 | |
| dc.subject | Discrete Mathematics | |
| dc.title | A distributed algorithm for computing and updating the process number of a forest | |
| dc.type | text |