Maximal flow through a network. Ford, L. & Fulkerson, D. Can J Math, 8:399–404, 1956. bibtex @Article{ford56maximal,
author = {Ford, L.R. and Fulkerson, D.R.},
title = {Maximal flow through a network},
journal = {Can J Math},
year = {1956},
volume = {8},
pages = {399--404},
owner = {Standard},
timestamp = {2006.12.01},
}
Downloads: 0
{"_id":"DpdmefnLJmYdqDs5w","bibbaseid":"ford-fulkerson-maximalflowthroughanetwork-1956","authorIDs":[],"author_short":["Ford, L.","Fulkerson, D."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Ford"],"firstnames":["L.R."],"suffixes":[]},{"propositions":[],"lastnames":["Fulkerson"],"firstnames":["D.R."],"suffixes":[]}],"title":"Maximal flow through a network","journal":"Can J Math","year":"1956","volume":"8","pages":"399–404","owner":"Standard","timestamp":"2006.12.01","bibtex":"@Article{ford56maximal,\n author = {Ford, L.R. and Fulkerson, D.R.},\n title = {Maximal flow through a network},\n journal = {Can J Math},\n year = {1956},\n volume = {8},\n pages = {399--404},\n owner = {Standard},\n timestamp = {2006.12.01},\n}\n\n","author_short":["Ford, L.","Fulkerson, D."],"key":"ford56maximal","id":"ford56maximal","bibbaseid":"ford-fulkerson-maximalflowthroughanetwork-1956","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:50:41.929Z","downloads":0,"keywords":[],"search_terms":["maximal","flow","through","network","ford","fulkerson"],"title":"Maximal flow through a network","year":1956,"dataSources":["C5FtkvWWggFfMJTFX"]}