论文信息 - Maximal matching stabilizes in time O(m) - 字舞流文

Maximal matching stabilizes in time O(m)

Abstract 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.

Pradip K. Srimani | Stephen T. Hedetniemi | David Pokrass Jacobs | S. Hedetniemi | D. Jacobs | P. Srimani | D. P. Jacobs

[1] Shing-Tsaan Huang,et al. A Self-Stabilizing Algorithm for Maximal Matching , 1992, Inf. Process. Lett..

[2] Gerard Tel,et al. Maximal Matching Stabilizes in Quadratic Time , 1994, Inf. Process. Lett..