Searching for "Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching." – 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.

Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching
by David R. Karger, Matthew S. Levine — 1997 — In Proc. of the 30th Annual ACM Symposium on Theory of Computing
…Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching David R. Karger…
Cited by 7 (0 self) – Add To MetaCart

Showing 1 through 1.

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