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


We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for anonymous networks without a cycle of a length of a multiple of 3 under a central unfair daemon. Let e be the number of edges and let n be the number of nodes in a graph. The time complexity is O(e) moves. Therefore, the complexity is O(n) moves for trees or rings… (More)
DOI: 10.1007/978-3-319-15612-5_17


6 Figures and Tables


Citations per Year

Citation Velocity: 10

Averaging 10 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics