{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T23:11:08Z","timestamp":1723245068401},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,4,10]],"date-time":"2015-04-10T00:00:00Z","timestamp":1428624000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s00453-015-9998-5","type":"journal-article","created":{"date-parts":[[2015,4,9]],"date-time":"2015-04-09T12:54:21Z","timestamp":1428584061000},"page":"1224-1266","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Maximum Likelihood Analysis of the Ford\u2013Fulkerson Method on Special Graphs"],"prefix":"10.1007","volume":"74","author":[{"given":"Ulrich","family":"Laube","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus E.","family":"Nebel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,10]]},"reference":[{"issue":"3","key":"9998_CR1","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1214\/ss\/1030037906","volume":"12","author":"J Aldrich","year":"1997","unstructured":"Aldrich, J.: R. A. Fisher and the making of maximum likelihood 1912\u20131922. Stat. Sci. 12(3), 162\u2013176 (1997)","journal-title":"Stat. Sci."},{"key":"9998_CR2","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/opre.1080.0572","volume":"57","author":"B Chandran","year":"2009","unstructured":"Chandran, B., Hochbaum, D.: A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem. Oper. Res. 57, 358\u2013376 (2009)","journal-title":"Oper. Res."},{"issue":"2","key":"9998_CR3","first-page":"299","volume":"24","author":"T Chi","year":"1998","unstructured":"Chi, T., Geman, S.: Estimation of probabilistic context-free grammars. Comput. Linguist. 24(2), 299\u2013308 (1998)","journal-title":"Comput. Linguist."},{"key":"9998_CR4","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Languages","author":"N Chomsky","year":"1963","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.P.: The algebraic theory of context-free languages. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Languages, pp. 118\u2013161. North Holland, New York (1963)"},{"key":"9998_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/0471722162","volume-title":"Order Statistics","author":"HA David","year":"2003","unstructured":"David, H.A., Nagaraja, H.N.: Order Statistics, 3rd edn. Wiley, New York (2003)","edition":"3"},{"key":"9998_CR6","first-page":"1277","volume":"11","author":"EA Dinic","year":"1970","unstructured":"Dinic, E.A.: An algorithm for the solution of the max-flow problem with the polynomial estimation. Sov. Math. Dokl. 11, 1277\u20131280 (1970). Dokl. Akad. Nauk SSSR 194, 1970, no. 4 (in Russian)","journal-title":"Sov. Math. Dokl."},{"issue":"7","key":"9998_CR7","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1145\/364520.364540","volume":"7","author":"R Durstenfeld","year":"1964","unstructured":"Durstenfeld, R.: Algorithm 235: random permutation. Commun. ACM 7(7), 420 (1964)","journal-title":"Commun. ACM"},{"issue":"2","key":"9998_CR8","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"9998_CR9","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erdos","year":"1959","unstructured":"Erdos, P., R\u00e9nyi, A.: On random graphs I. Publ. Math. Debr. 6, 290\u2013297 (1959)","journal-title":"Publ. Math. Debr."},{"key":"9998_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)"},{"key":"9998_CR11","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"9998_CR12","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30, 1141\u20131144 (1959)","journal-title":"Ann. Math. Stat."},{"key":"9998_CR13","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290181","volume":"45","author":"AV Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. Assoc. Comput. Mach. 45, 753\u2013782 (1998)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9998_CR14","first-page":"83","volume":"13","author":"D Goldfab","year":"1988","unstructured":"Goldfab, D., Grigoriads, M.D.: A computational comparison of the dinic and network simplex methods for maximum flow. Ann. Oper. Res. 13, 83\u2013123 (1988)","journal-title":"Ann. Oper. Res."},{"key":"9998_CR15","volume-title":"The Art of Computer Programming, Volume 1: Fundamental Algorithms","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd edn. Addison Wesley, Reading (1997)","edition":"3"},{"key":"9998_CR16","volume-title":"The Art of Computer Programming, Volume 2: Seminumerical Algorithms","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd edn. Addison Wesley, Reading (1998)","edition":"3"},{"issue":"1","key":"9998_CR17","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.tcs.2009.09.025","volume":"411","author":"U Laube","year":"2010","unstructured":"Laube, U., Nebel, M.E.: Maximum likelihood analysis of algorithms and data structures. Theor. Comput. Sci. 411(1), 188\u2013212 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9998_CR18","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1145\/195613.195663","volume":"41","author":"R Motwani","year":"1994","unstructured":"Motwani, R.: Average-case analysis of algorithms for matchings and related problems. J. ACM 41(6), 1329\u20131356 (1994)","journal-title":"J. ACM"},{"key":"9998_CR19","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in $${O}(nm)$$ O ( n m ) time, or better. In: STOC \u201913: Proceedings of the 45th Annual ACM Symposium on Symposium on Theory of Computing, pp. 765\u2013774. ACM, New York, NY, USA (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"9998_CR20","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"M Penrose","year":"2003","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)"},{"key":"9998_CR21","unstructured":"Sedgewick, R.: Putting the science back into computer science. www.cs.princeton.edu\/rs\/talks\/ScienceCS10.pdf (2010). Accessed 25 Nov 2014"},{"key":"9998_CR22","unstructured":"Sedgewick, R.: The role of the scientific method in programming. www.cs.princeton.edu\/rs\/talks\/ScienceCS.pdf (2010). Accessed 25 Nov 2014"},{"key":"9998_CR23","volume-title":"Algorithms","author":"R Sedgewick","year":"2011","unstructured":"Sedgewick, R., Wayne, K.: Algorithms, 4th edn. Addison Wesley, Reading (2011)","edition":"4"},{"key":"9998_CR24","first-page":"30","volume":"9","author":"VG Vizing","year":"1963","unstructured":"Vizing, V.G.: The cartesian product of graphs. Vy\u010disl. Sistemy 9, 30\u201343 (1963)","journal-title":"Vy\u010disl. Sistemy"},{"key":"9998_CR25","doi-asserted-by":"crossref","unstructured":"Wild, S., Nebel, M., Reitzig, R., Laube, U.: Engineering java 7\u2019s dual pivot quicksort using malijan. In: ALENEX 2013: Proceedings of the Meeting on Algorithm Engineering and Experiments, pp. 55\u201370. New Orleans, USA (2013)","DOI":"10.1137\/1.9781611972931.5"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9998-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-9998-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9998-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T09:38:09Z","timestamp":1691573889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-9998-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,10]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9998"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-9998-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,10]]}}}