A self-stabilizing graph algorithm: Finding the cutting center of a tree

被引：1
|
作者：
Chaudhuri, P [1 ]
Thompson, H [1 ]
机构：
[1] Univ W Indies, Dept Comp Sci Math & Phys, Bridgetown, Barbados
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 2004年 / 81卷 / 02期
关键词：
distributed system; self-stabilizing algorithm; tree; cutting center; complexity;
D O I：
10.1080/00207160310001650062
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The cutting number of a node i in a connected graph G is the number of pairs of nodes in different components of G-{i}. The cutting center consists of the set of nodes of G with maximal cutting number. This article presents a self-stabilizing algorithm for finding the cutting numbers for all nodes of a tree T= (V-T, E-T) and hence the cutting center of T . It is shown that the proposed self-stabilizing algorithm requires O(n(2)) moves. The algorithm complexity can also be expressed as O(n) rounds.
引用
收藏
页码：183 / 190
页数：8
相关论文
共 50 条
  • [1] A self-stabilizing algorithm for finding the cutting center of a tree
    Chaudhuri, P
    Thompson, H
    PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4, 2003, : 1460 - 1463
  • [2] A self-stabilizing algorithm for finding articulation nodes in a graph
    Chaudhuri, P.
    International Journal of Parallel and Distributed Systems and Networks, 2001, 4 (01): : 1 - 7
  • [3] A self-stabilizing distributed algorithm to find the median of a tree graph
    Antonoiu, G
    Srimani, PK
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1999, 58 (01) : 215 - 221
  • [4] Constant Space Self-Stabilizing Center Finding in Anonymous Tree Networks
    Datta, Ajoy K.
    Larmore, Lawrence L.
    Masuzawa, Toshimitsu
    PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING, 2015,
  • [5] A self-stabilizing algorithm for bridge finding
    Karaata, MH
    Chaudhuri, P
    DISTRIBUTED COMPUTING, 1999, 12 (01) : 47 - 53
  • [6] A distributed self-stabilizing algorithm for finding a connected dominating set in a graph
    Jain, A
    Gupta, A
    PDCAT 2005: Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, Proceedings, 2005, : 615 - 619
  • [7] A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
    Kosowski, Adrian
    Kuszner, Lukasz
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2006, 3911 : 75 - 82
  • [8] A self-stabilizing algorithm which finds a 2-center of a tree
    Huang, TC
    Lin, JC
    Chen, HJ
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2000, 40 (4-5) : 607 - 624
  • [9] Self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
    Antonoiu, G.
    Srimani, P.K.
    Computers and Mathematics with Applications, 1998, 35 (10): : 15 - 23
  • [10] A self-stabilizing distributed algorithm for Minimal Spanning Tree problem in a symmetric graph
    Antonoiu, G
    Srimani, PK
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1998, 35 (10) : 15 - 23
12345