Searching for "A Decomposition Theorem for Maximum Weight Bipartite Matchings." – 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.

A Decomposition Theorem For Maximum Weight Bipartite Matchings
by Ming-Yang Kao, Tak-Wah LAM, WING-KIN SUNG, HING-FUNG TING — 1999
…A DECOMPOSITION THEOREM FOR MAXIMUM WEIGHT BIPARTITE MATCHINGS MING-YANG KAO y , TAK-WAH LAM z…
Cited by 11 (2 self) – Add To MetaCart

An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
by Ming-yang Kao, Tak-wah Lam, Wing-kin Sung, Hing-fung Ting — 2001 — Journal of Algorithms
… algorithms. Another contribution of this paper is on maximum weight bipartite matchings. We show how to speed…
Cited by 8 (3 self) – Add To MetaCart

Showing 1 through 2.

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