Fast optimal parallel algorithms for maximal matching in sparse graphs.
H. Asuri, M. Dillencourt, D. Eppstein,
G. Lueker, and M. Molodowitch.
Tech. Rep. 92-01, ICS, UCI, 1992.
We later discovered that the same results were published
in a SPAA paper by Greg Shannon.