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 条
  • [41] O(n) Time Algorithms for Dominating Induced Matching Problems
    Lin, Min Chih
    Mizrahi, Michel J.
    Szwarcfiter, Jayme L.
    LATIN 2014: THEORETICAL INFORMATICS, 2014, 8392 : 399 - 408
  • [42] Matching nuts and bolts in O(n log n) time
    Komlos, J
    Ma, Y
    Szemeredi, E
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (03) : 347 - 372
  • [43] Tree pattern matching and subset matching in deterministic O(nlog3n)-time
    Cole, R
    Hariharan, R
    Indyk, P
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 245 - 254
  • [44] Maximal assortative matching for complex network graphs
    Meghanathan, Natarajan
    JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2016, 28 (02) : 230 - 246
  • [45] Determinants of Performance in Paced and Maximal 800-m Running Time Trials
    Bellinger, Phillip
    Derave, Wim
    Lievens, Eline
    Kennedy, Ben
    Arnold, Blayne
    Rice, Hal
    Minahan, Clare
    MEDICINE & SCIENCE IN SPORTS & EXERCISE, 2021, 53 (12) : 2635 - 2644
  • [46] An O(m log m)-Time Algorithm for Detecting Superbubbles
    Sung, Wing-Kin
    Sadakane, Kunihiko
    Shibuya, Tetsuo
    Belorkar, Abha
    Pyrogova, Iana
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2015, 12 (04) : 770 - 777
  • [47] Global maximal utility optimizer for resident matching
    Wu, Yue
    Spaide, Theodore
    Kihara, Yuka
    Lee, Cecilia S.
    Yanagihara, Ryan T.
    Owen, Julia
    Lee, Aaron Y.
    Van Gelder, Russell
    INVESTIGATIVE OPHTHALMOLOGY & VISUAL SCIENCE, 2020, 61 (07)
  • [48] EFFICIENT ALGORITHMS FOR FINDING MAXIMAL MATCHING IN GRAPHS
    GALIL, Z
    LECTURE NOTES IN COMPUTER SCIENCE, 1983, 159 : 90 - 113
  • [49] On the complexity of minimum maximal uniquely restricted matching
    Chaudhary, Juhi
    Panda, B. S.
    THEORETICAL COMPUTER SCIENCE, 2021, 882 : 15 - 28
  • [50] Backlog analysis of maximal matching switching with speedup
    Cogill, Randy
    Lall, Sanjay
    PROCEEDINGS OF THE 45TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14, 2006, : 1877 - +
12345