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 条
  • [21] SELF-STABILIZING GRAPH PROTOCOLS
    Goddard, Wayne
    Hedetniemi, Stephen T.
    Jacobs, David P.
    Srimani, Pradip K.
    Xu, Zhenyu
    PARALLEL PROCESSING LETTERS, 2008, 18 (01) : 189 - 199
  • [22] A quasi self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given
    Biclak, Halina
    Panczyk, Michal
    2013 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2013, : 293 - 297
  • [23] Self-stabilizing tree ranking
    Chaudhuri, P
    Thompson, H
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2005, 82 (05) : 529 - 539
  • [24] A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity
    Huang, TC
    Lin, JC
    Mou, N
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2004, 48 (10-11) : 1667 - 1676
  • [25] Self-stabilizing distributed algorithm for strong matching in a system graph
    Goddard, W
    Hedetniemi, ST
    Jacobs, DP
    Srimani, PK
    HIGH PERFORMANCE COMPUTING - HIPC 2003, 2003, 2913 : 66 - 73
  • [26] Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees
    Sudo, Yuichi
    Datta, Ajoy K.
    Larmore, Lawrence L.
    Masuzawa, Toshimitsu
    PARALLEL PROCESSING LETTERS, 2018, 28 (01)
  • [27] A Self-stabilizing Algorithm for Locating the Center of Maximal Outerplanar Graphs
    Panczyk, Michal
    Bielak, Halina
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2014, 20 (14) : 1951 - 1963
  • [28] A SILENT SELF-STABILIZING ALGORITHM FOR FINDING CUT- NODES AND BRIDGES
    Devismes, Stephane
    PARALLEL PROCESSING LETTERS, 2005, 15 (1-2)
  • [29] SKIP: A Self-Stabilizing Skip Graph
    Jacob, Riko
    Richa, Andrea
    Scheideler, Christian
    Schmid, Stefan
    Taeubig, Hanjo
    JOURNAL OF THE ACM, 2014, 61 (06) : 1 - 26
  • [30] A self-stabilizing enumeration algorithm
    Godard, E
    INFORMATION PROCESSING LETTERS, 2002, 82 (06) : 299 - 305
12345