John D. Kececioglu, A. Justin Pecqueur. Computing Maximum-Cardinality Matchings in Sparse General Graphs. In Kurt Mehlhorn, editor, Algorithm Engineering, 2nd International Workshop, WAE 92, Saarbrücken, Germany, August 20-22, 1998, Proceedings. pages 121-132, Max-Planck-Institut für Informatik, 1998.
Abstract is missing.