Searching for "Efficient Algorithms for Finding Maximum Matching in Graphs." – sorted by Relevance.

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

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

1 documents found, showing 1 through 1.

Approximation Algorithms for Survivable Optical Networks (Extended Abstract)
by T. Eilam, S. Moran, S. Zaks — 2000 — In The 14th international Symposium on Distributed Computing (DISC
… in the endnode graphs. Efficient algorithms for finding maximum matchings in graphs can be found in, e.g., [MV80…
Cited by 6 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB