The Time Complexity of Hsu and Huang's Self-Stabilizing Maximal Matching Algorithm

Masahiro KIMOTO; Tatsuhiro TSUCHIYA; Tohru KIKUNO

doi:10.1587/transinf.E93.D.2850

IEICE Transactions on Information and Systems

Online ISSN : 1745-1361
Print ISSN : 0916-8532

Regular Section

The Time Complexity of Hsu and Huang's Self-Stabilizing Maximal Matching Algorithm

Masahiro KIMOTO, Tatsuhiro TSUCHIYA, Tohru KIKUNO

Author information

Keywords: self-stabilization, maximal matching, time complexity, stabilization time, distributed computing

JOURNAL FREE ACCESS

2010 Volume E93.D Issue 10 Pages 2850-2853

DOI https://doi.org/10.1587/transinf.E93.D.2850

Details

Abstract

The exact time complexity of Hsu and Huan's self-stabilizing maximal matching algorithm is provided. It is $\\frac{1}{2}n^2 + n - 2$ if the number of nodes n is even and $\\frac{1}{2}n^2 + n - \\frac{5}{2}$ if n is odd.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!