1. Avis D (1983) A survey of heuristics for the weighted matching problem. Networks 13:475–493
2. Czygrinow A, Hanckowiak M, Szymanska E (2004) A fast distributed algorithm for approximating the maximum matching. In: Proc 12th ann European symp on algorithms (ESA), pp 252–263
3. Edmonds J (1965) Path, trees, and flowers. Can J Math 17:449–467
4. Goddard W, Hedetniemi ST, Jacobs DP, Srimani PK (2003) Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In: Proc international parallel and distributed processing symposium
5. Goldberg A, Plotkin SA (1987) Parallel (Δ+1) coloring of constant-degree graphs. Inf Process Lett 4:241–245