Computing Maximum-Cardinality Matchings in Sparse General Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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.

This author has not been identified. Look up 'John D. Kececioglu' in GoogleThis author has not been identified. Look up 'A. Justin Pecqueur' in Google

runs on WebDSL