Searching for "Computing Maximum-Cardinality Matchings in Sparse General Graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Proceedings WAE'98, Saarbrucken, Germany, August 20--22, 1998 Ed. Kurt Mehlhorn, pp. 121--132
by Computing Maximum-Cardinality Matchings, John D. Kececioglu, A. Justin Pecqueur
…--132 Computing maximum-cardinality matchings in sparse general graphs John D. Kececioglu 1 A. Justin Pecqueur…
Add To MetaCart

2nd Workshop on Algorithm Engineering WAE'98 - Proceedings
by Kurt Mehlhorn (ed.), Kurt Mehlhorn, Kurt Mehlhorn — 1998
…. Frank van der Stappen, and Jules Vleugels 110 Computing maximum-cardinality matchings in sparse general…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB