| | |
@inproceedings{DBLP:conf/stoc/KargerL98,
author = {David R. Karger and
Matthew S. Levine},
title = {Finding Maximum Flows in Undirected Graphs Seems Easier
than Bipartite Matching},
booktitle = {STOC},
year = {1998},
pages = {69-78},
ee = {http://doi.acm.org/10.1145/276698.276714},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Last update 2009-06-09 CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page