A Distributed Algorithm for Computing the Node Search Number in Trees

被引：0
|
作者：
David Coudert
Florian Huc
Dorian Mazauric
机构：
[1] Univ. Nice Sophia,MASCOTTE, INRIA, I3S, CNRS
[2] Laboratory of Distributed Programming,EPFL
来源：
Algorithmica | 2012年 / 63卷
关键词：
Distributed algorithm; Edge search number; Graph searching; Node search number; Pathwidth; Process number;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present a distributed algorithm to compute the node search number in trees. This algorithm extends the centralized algorithm proposed by Ellis et al. (Inf. Comput. 113(1):50–79, 1994). It can be executed in an asynchronous environment, requires an overall computation time of O(nlog n), and n messages of log 3n+4 bits each.
引用
收藏
页码：158 / 190
页数：32
相关论文
共 50 条
  • [1] A Distributed Algorithm for Computing the Node Search Number in Trees
    Coudert, David
    Huc, Florian
    Mazauric, Dorian
    [J]. ALGORITHMICA, 2012, 63 (1-2) : 158 - 190
  • [2] A Reduction Algorithm for Computing The Hybridization Number of Two Trees
    Bordewich, Magnus
    Linz, Simone
    John, Katherine St.
    Semple, Charles
    [J]. EVOLUTIONARY BIOINFORMATICS, 2007, 3 : 86 - 98
  • [3] A Distributed Algorithm for Computing and Updating the Process Number of a Forest
    Coudert, David
    Huc, Florian
    Mazauric, Dorian
    [J]. DISTRIBUTED COMPUTING, PROCEEDINGS, 2008, 5218 : 500 - 501
  • [4] Optimal Processing Node Discovery Algorithm for Distributed Computing in IoT
    Kolcun, Roman
    Boyle, David
    McCann, Julie A.
    [J]. PROCEEDINGS 2015 5TH INTERNATIONAL CONFERENCE ON THE INTERNET OF THINGS (IOT), 2015, : 72 - 79
  • [5] Quantum distributed computing applied to grover’s search algorithm
    Goswami, Debabrata
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8808 : 192 - 199
  • [6] NEW DISTRIBUTED ALGORITHM TO FIND BREADTH FIRST SEARCH TREES.
    Awerbuch, Baruch
    Gallager, Robert G.
    [J]. 1600, (IT-33):
  • [7] On the node structure of binary search trees
    Dekking, FM
    De Graaf, S
    Meester, LE
    [J]. MATHEMATICS AND COMPUTER SCIENCE: ALGORITHMS, TREES, COMBINATORICS AND PROBABILITIES, 2000, : 31 - 40
  • [8] Approach to Determining the Boundaries of the Search Range for the Number of Trees in the Random Forest Algorithm
    Demidova, Liliya
    Ivkina, Maria
    [J]. 2020 9TH MEDITERRANEAN CONFERENCE ON EMBEDDED COMPUTING (MECO), 2020, : 257 - 260
  • [9] Two-Way Trees: A Distributed Algorithm for Efficient Replica Search and Placement
    Park, Gahyun
    Kwon, Minseok
    Tamilselvan, Ramprasad
    Lee, Seungjoon
    [J]. SYMPOSIUM ON ALGORITHMIC PRINCIPLES OF COMPUTER SYSTEMS, APOCS, 2020, : 133 - 146
  • [10] Computing and Updating the Process Number in Trees
    Coudert, David
    Huc, Florian
    Mazauric, Dorian
    [J]. PRINCIPLES OF DISTRIBUTED SYSTEMS, 12TH INTERNATIONAL CONFERENCE, OPODIS 2008, 2008, 5401 : 546 - 550
12345