default search action
BibTeX record conf/stoc/KargerL98
@inproceedings{DBLP:conf/stoc/KargerL98, author = {David R. Karger and Matthew S. Levine}, editor = {Jeffrey Scott Vitter}, title = {Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching}, booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998}, pages = {69--78}, publisher = {{ACM}}, year = {1998}, url = {https://doi.org/10.1145/276698.276714}, doi = {10.1145/276698.276714}, timestamp = {Sun, 02 Oct 2022 16:16:12 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KargerL98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.