An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs. - K. V. R. C. N. Kishore; Sanjeev Saxena (Inf. Process. Lett., 2000)