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

Kimoto, Masahiro; Tsuchiya, Tatsuhiro; Kikuno, Tohru

doi:10.1587/transinf.e93.d.2850

Cited by 4 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hsu and Huang [11] proposed a maximal matching algorithm for anonymous networks with arbitrary topology under a central daemon. They showed the time complexity of O(n 3 ) moves, and, it has been revealed that the time complexity of their algorithm is O(n 2 ) moves by Tel [17] and Kimoto et al [13] and O(e) moves by Hedetniemi et al [10].…”

Section: Introductionmentioning

confidence: 99%

An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks

Yuma¹,

Ooshita²,

Inoue³

2016

JGAA

View full text Add to dashboard Cite

We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for any anonymous networks without a cycle of length of a multiple of 3 under a central unfair daemon. The 1-maximal matching is a 2 3-approximation to the maximum matching, and expected to get more matching pairs than a maximal matching, which only guarantees a 1 2-approximation. The time complexity of the proposed algorithm is O(e) moves, which is O(n) moves if we restrict the topology to trees or rings whose length is not a multiple of 3, where n and e be the numbers of nodes and edges in a graph, respectively. The best existing result for 1-maximal matching for anonymous networks is an algorithm of Goddard et al. [8] which works for anonymous trees and anonymous rings whose length is not a multiple of 3 under a central daemon, and the time complexity is O(n 4) moves. Therefore, the result in this paper is a significant improvement from the best existing results.

show abstract

Section: Introductionmentioning

confidence: 99%

An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks

Yuma¹,

Ooshita²,

Inoue³

2016

JGAA

View full text Add to dashboard Cite

show abstract

An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks

Asada

Inoue

2015

WALCOM: Algorithms and Computation

View full text Add to dashboard Cite

An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon Without Global Identifiers

Inoue¹,

Ooshita²,

Tixeuil³

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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

Abstract: SUMMARYThe exact time complexity of Hsu and Huan's selfstabilizing maximal matching algorithm is provided. It is 1 2 n 2 + n − 2 if the number of nodes n is even and 1 2 n 2 + n − 5 2 if n is odd.

Cited by 4 publications

References 5 publications

An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks

An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks

An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks

An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon Without Global Identifiers

Contact Info

Product

Resources

About