Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs
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
Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs
STOC, 1997.

STOC 1997
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1997-Karger,
	author        = "David R. Karger",
	booktitle     = "{Proceedings of the 29th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/258533.258596",
	isbn          = "0-89791-888-6",
	pages         = "240--249",
	publisher     = "{ACM}",
	title         = "{Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs}",
	year          = 1997,
}

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.