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

Copy

Masahiro KIMOTO, Tatsuhiro TSUCHIYA, Tohru KIKUNO, "The Time Complexity of Hsu and Huang's Self-Stabilizing Maximal Matching Algorithm" in IEICE TRANSACTIONS on Information, vol. E93-D, no. 10, pp. 2850-2853, October 2010, doi: 10.1587/transinf.E93.D.2850.
Abstract: The exact time complexity of Hsu and Huan's self-stabilizing maximal matching algorithm is provided. It is n² + n - 2 if the number of nodes n is even and n² + n - if n is odd.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.2850/_p

Copy

@ARTICLE{e93-d_10_2850,
author={Masahiro KIMOTO, Tatsuhiro TSUCHIYA, Tohru KIKUNO, },
journal={IEICE TRANSACTIONS on Information},
title={The Time Complexity of Hsu and Huang's Self-Stabilizing Maximal Matching Algorithm},
year={2010},
volume={E93-D},
number={10},
pages={2850-2853},
abstract={The exact time complexity of Hsu and Huan's self-stabilizing maximal matching algorithm is provided. It is n² + n - 2 if the number of nodes n is even and n² + n - if n is odd.},
keywords={},
doi={10.1587/transinf.E93.D.2850},
ISSN={1745-1361},
month={October},}

Copy

TY - JOUR
TI - The Time Complexity of Hsu and Huang's Self-Stabilizing Maximal Matching Algorithm
T2 - IEICE TRANSACTIONS on Information
SP - 2850
EP - 2853
AU - Masahiro KIMOTO
AU - Tatsuhiro TSUCHIYA
AU - Tohru KIKUNO
PY - 2010
DO - 10.1587/transinf.E93.D.2850
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2010
AB - The exact time complexity of Hsu and Huan's self-stabilizing maximal matching algorithm is provided. It is n² + n - 2 if the number of nodes n is even and n² + n - if n is odd.
ER -

IEICE TRANSACTIONS on Information