%0 Conference Paper %1 conf/stoc/KargerL98 %A Karger, David R. %A Levine, Matthew S. %B STOC %D 1998 %E Vitter, Jeffrey Scott %I ACM %K dblp %P 69-78 %T Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching. %U http://dblp.uni-trier.de/db/conf/stoc/stoc1998.html#KargerL98 %@ 0-89791-962-9

@inproceedings{conf/stoc/KargerL98, added-at = {2022-10-02T00:00:00.000+0200}, author = {Karger, David R. and Levine, Matthew S.}, biburl = {https://www.bibsonomy.org/bibtex/2dbfc786f371a5e18546991693be5cc82/dblp}, booktitle = {STOC}, crossref = {conf/stoc/1998}, editor = {Vitter, Jeffrey Scott}, ee = {https://doi.org/10.1145/276698.276714}, interhash = {a0e074b36738c697a446e729685cdefe}, intrahash = {dbfc786f371a5e18546991693be5cc82}, isbn = {0-89791-962-9}, keywords = {dblp}, pages = {69-78}, publisher = {ACM}, timestamp = {2024-04-10T17:51:58.000+0200}, title = {Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching.}, url = {http://dblp.uni-trier.de/db/conf/stoc/stoc1998.html#KargerL98}, year = 1998 }