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.