首页   按字顺浏览 期刊浏览 卷期浏览 A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH

 

作者: GHEORGHE ANTONOIU,   PRADIPK SRIMANI,  

 

期刊: Parallel Algorithms and Applications  （Taylor Available online 1997）
卷期: Volume 10, issue 3-4  

页码: 237-248

 

ISSN:1063-7192

 

年代: 1997

 

DOI:10.1080/10637199708915620

 

出版商: Taylor & Francis Group

 

关键词: Distributed algorithm;self stabilizing algorithm;center of a tree;mathematical induction;correctness proof

 

数据来源: Taylor

 

摘要:

We propose a simple and elegant distributed self-stabilizing algorithm to find the center of an arbitrary tree graph. The algorithm is uniform over all nodes of the tree. We prove the self-stabilization of the distributed algorithm using mathematical induction; we did not need to design a bounded function on the global state (which is customary for proving correctness of self-stabilizing algorithms).

 

点击下载:  PDF (215KB)



返 回