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 条
  • [41] A self-stabilizing algorithm for strong fairness
    M. H. Karaata
    P. Chaudhuri
    Computing, 1998, 60 : 217 - 228
  • [42] Self-stabilizing algorithm for strong fairness
    Karaata, M.H.
    Chaudhuri, P.
    Computing (Vienna/New York), 1998, 60 (03): : 217 - 228
  • [43] Robust self-stabilizing clustering algorithm
    Johnen, Colette
    Nguyen, Le Huy
    PRINCIPLES OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2006, 4305 : 410 - 424
  • [44] Self-Stabilizing Algorithm for Minimal Dominating Set with Safe Convergence in an Arbitrary Graph
    Ding, Yihua
    Wang, James Z.
    Srimani, Pradip K.
    PARALLEL PROCESSING LETTERS, 2015, 25 (04)
  • [45] A Self-stabilizing Algorithm for Two Disjoint Minimal Dominating Sets in an Arbitrary Graph
    Hong, Gongbing
    Srimani, Pradip K.
    PROCEEDINGS OF THE 49TH ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SOUTHEAST CONFERENCE (ACMSE '11), 2011, : 306 - 307
  • [46] Self-stabilizing Neighborhood Synchronizer in tree networks
    Johnen, C
    Alima, LO
    Datta, AK
    Tixeuil, S
    19TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 1999, : 487 - 494
  • [47] Efficient self-stabilizing algorithms for tree networks
    Blair, JRS
    Manne, F
    23RD INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2002, : 20 - 26
  • [48] Self-stabilizing anonymous leader election in a tree
    Xu, ZY
    Srimani, PK
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, 17 (02) : 323 - 335
  • [49] Self-stabilizing agent traversal on tree networks
    Nakaminami, Y
    Masuzawa, T
    Herman, T
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2004, E87D (12): : 2773 - 2780
  • [50] Brief announcement: Self-stabilizing spanning tree algorithm for large scale systems
    Herault, Thomas
    Lemarinier, Pierre
    Peres, Olivier
    Pilard, Laurence
    Beauquier, Joffroy
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2006, 4280 : 574 - +
12345