Can a maximum flow be computed in $o(nm)$ time?. Cheriyan, J., Hagerup, T., & Mehlhorn, K. In Proc. of International Colloquium on Automata, Languages and Programming (ICALP 1990), of Lect Notes Comput Sci, pages 235–248, 1990. Springer, Berlin. bibtex @InProceedings{cheriyan90can,
author = {Cheriyan, Joseph and Hagerup, Torben and Mehlhorn, Kurt},
title = {Can a maximum flow be computed in $o(nm)$ time?},
booktitle = {Proc. of International Colloquium on Automata, Languages and Programming (ICALP 1990)},
year = {1990},
number = {443},
series = lncs,
pages = {235--248},
publisher = Springer,
comment = {randomisierte Version, siehe King et al fuer die de-randomisierung},
isbn = {0-387-52826-1},
location = {Warwick University, England},
owner = {Sebastian},
timestamp = {2010.07.12},
}
Downloads: 0
{"_id":"sMs7LAFJtvXtpdrLN","bibbaseid":"cheriyan-hagerup-mehlhorn-canamaximumflowbecomputedinonmtime-1990","authorIDs":[],"author_short":["Cheriyan, J.","Hagerup, T.","Mehlhorn, K."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Cheriyan"],"firstnames":["Joseph"],"suffixes":[]},{"propositions":[],"lastnames":["Hagerup"],"firstnames":["Torben"],"suffixes":[]},{"propositions":[],"lastnames":["Mehlhorn"],"firstnames":["Kurt"],"suffixes":[]}],"title":"Can a maximum flow be computed in $o(nm)$ time?","booktitle":"Proc. of International Colloquium on Automata, Languages and Programming (ICALP 1990)","year":"1990","number":"443","series":"Lect Notes Comput Sci","pages":"235–248","publisher":"Springer, Berlin","comment":"randomisierte Version, siehe King et al fuer die de-randomisierung","isbn":"0-387-52826-1","location":"Warwick University, England","owner":"Sebastian","timestamp":"2010.07.12","bibtex":"@InProceedings{cheriyan90can,\n author = {Cheriyan, Joseph and Hagerup, Torben and Mehlhorn, Kurt},\n title = {Can a maximum flow be computed in $o(nm)$ time?},\n booktitle = {Proc. of International Colloquium on Automata, Languages and Programming (ICALP 1990)},\n year = {1990},\n number = {443},\n series = lncs,\n pages = {235--248},\n publisher = Springer,\n comment = {randomisierte Version, siehe King et al fuer die de-randomisierung},\n isbn = {0-387-52826-1},\n location = {Warwick University, England},\n owner = {Sebastian},\n timestamp = {2010.07.12},\n}\n\n","author_short":["Cheriyan, J.","Hagerup, T.","Mehlhorn, K."],"key":"cheriyan90can","id":"cheriyan90can","bibbaseid":"cheriyan-hagerup-mehlhorn-canamaximumflowbecomputedinonmtime-1990","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:50:41.737Z","downloads":0,"keywords":[],"search_terms":["maximum","flow","computed","time","cheriyan","hagerup","mehlhorn"],"title":"Can a maximum flow be computed in $o(nm)$ time?","year":1990,"dataSources":["C5FtkvWWggFfMJTFX"]}