Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs

Laube U, Nebel M (2016)
Algorithmica 74(4): 1224--1266.

Download
No fulltext has been uploaded. References only!
Journal Article | English

No fulltext has been uploaded

Author
;
Publishing Year
PUB-ID

Cite this

Laube U, Nebel M. Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs. Algorithmica. 2016;74(4):1224--1266.
Laube, U., & Nebel, M. (2016). Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs. Algorithmica, 74(4), 1224--1266. doi:10.1007/s00453-015-9998-5
Laube, U., and Nebel, M. (2016). Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs. Algorithmica 74, 1224--1266.
Laube, U., & Nebel, M., 2016. Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs. Algorithmica, 74(4), p 1224--1266.
U. Laube and M. Nebel, “Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs”, Algorithmica, vol. 74, 2016, pp. 1224--1266.
Laube, U., Nebel, M.: Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs. Algorithmica. 74, 1224--1266 (2016).
Laube, Ulrich, and Nebel, Markus. “Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs”. Algorithmica 74.4 (2016): 1224--1266.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar