Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

David R. Karger, Matthew S. Levine
Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching
STOC, 1998.

STOC 1998
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1998-KargerL,
	author        = "David R. Karger and Matthew S. Levine",
	booktitle     = "{Proceedings of the 30th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/276698.276714",
	isbn          = "0-89791-962-9",
	pages         = "69--78",
	publisher     = "{ACM}",
	title         = "{Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching}",
	year          = 1998,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.