Can A Maximum Flow be Computed on o(nm) Time?
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

Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn
Can A Maximum Flow be Computed on o(nm) Time?
ICALP, 1990.

ICALP 1990
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-1990-CheriyanHM,
	author        = "Joseph Cheriyan and Torben Hagerup and Kurt Mehlhorn",
	booktitle     = "{Proceedings of the 17th International Colloquium on Automata, Languages and Programming}",
	doi           = "10.1007/BFb0032035",
	isbn          = "3-540-52826-1",
	pages         = "235--248",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Can A Maximum Flow be Computed on o(nm) Time?}",
	volume        = 443,
	year          = 1990,
}

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.