Maximal matching stabilizes in time O(m)

被引：25
|
作者：
Hedetniemi, ST [1 ]
Jacobs, DP [1 ]
Srimani, PK [1 ]
机构：
[1] Clemson Univ, Dept Comp Sci, Clemson, SC 29634 USA
来源：
INFORMATION PROCESSING LETTERS | 2001年 / 80卷 / 05期
关键词：
analysis of algorithms; matching; self-stabilizing;
D O I：
10.1016/S0020-0190(01)00171-5
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
On a network having m edges and n nodes, Hsu and Huang's self-stabilizing algorithm for maximal matching stabilizes in at most 2m + n moves. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：221 / 223
页数：3
相关论文
共 50 条
  • [31] Maximal matching scheduling is good enough
    Shah, D
    GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, : 3009 - 3013
  • [32] A DNA Algorithm for the maximal matching problem
    Wenxia Li
    E. M. Patrikeev
    Dongmei Xiao
    Automation and Remote Control, 2015, 76 : 1797 - 1802
  • [33] AN EFFICIENT PARALLEL ALGORITHM FOR MAXIMAL MATCHING
    DATTA, AK
    SEN, RK
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 634 : 813 - 814
  • [34] AN OPTIMAL PARALLEL ALGORITHM FOR MAXIMAL MATCHING
    KELSEN, P
    INFORMATION PROCESSING LETTERS, 1994, 52 (04) : 223 - 228
  • [35] Dynamic Maximal Matching in Clique Networks
    Li, Minming
    Robinson, Peter
    Zhu, Xianbin
    15TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE, ITCS 2024, 2024,
  • [36] Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time
    Grabowski, Szymon
    Fredriksson, Kimmo
    INFORMATION PROCESSING LETTERS, 2008, 105 (05) : 182 - 187
  • [37] An O (n2 log m)-time algorithm for the boxed-mesh permutation pattern matching problem
    Cho, Sukhyeun
    Na, Joong Chae
    Sim, Jeong Seop
    THEORETICAL COMPUTER SCIENCE, 2018, 710 : 35 - 43
  • [38] Video clip retrieval by maximal matching and optimal matching in graph theory
    Peng, YX
    Ngo, CW
    Dong, QJ
    Guo, ZM
    Xiao, JG
    2003 INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, VOL I, PROCEEDINGS, 2003, : 317 - 320
  • [39] Maximal Hypersurfaces of (m
    Dursun, Ugur
    KYUNGPOOK MATHEMATICAL JOURNAL, 2008, 48 (01): : 109 - 121
  • [40] Matching nuts and bolts in O(n log n) time
    Komlos, J
    Ma, Y
    Szemeredi, E
    PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 232 - 241
12345