%0 Conference Paper %1 KL98 %A Karger, David R. %A Levine, Matthew S. %B STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing %C New York, NY, USA %D 1998 %I ACM Press %K 3(2006)12 %P 69--78 %R http://doi.acm.org/10.1145/276698.276714 %T Finding maximum flows in undirected graphs seems easier than bipartite matching %@ 0-89791-962-9

@inproceedings{KL98, added-at = {2008-01-10T17:04:02.000+0100}, address = {New York, NY, USA}, author = {Karger, David R. and Levine, Matthew S.}, biburl = {https://www.bibsonomy.org/bibtex/2dfd2f34b95e5bd35a0ffa26cf829c2e9/jvrb_regulski}, booktitle = {STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing}, doi = {http://doi.acm.org/10.1145/276698.276714}, interhash = {a0e074b36738c697a446e729685cdefe}, intrahash = {dfd2f34b95e5bd35a0ffa26cf829c2e9}, isbn = {0-89791-962-9}, keywords = {3(2006)12}, location = {Dallas, Texas, United States}, pages = {69--78}, publisher = {ACM Press}, timestamp = {2008-01-10T17:06:15.000+0100}, title = {Finding maximum flows in undirected graphs seems easier than bipartite matching}, year = 1998 }