{"id":"https://openalex.org/W2101318995","doi":"https://doi.org/10.1007/s00453-015-9998-5","title":"Maximum Likelihood Analysis of the Ford\u2013Fulkerson Method on Special Graphs","display_name":"Maximum Likelihood Analysis of the Ford\u2013Fulkerson Method on Special Graphs","publication_year":2015,"publication_date":"2015-04-09","ids":{"openalex":"https://openalex.org/W2101318995","doi":"https://doi.org/10.1007/s00453-015-9998-5","mag":"2101318995"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-015-9998-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-015-9998-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038195059","display_name":"Ulrich Laube","orcid":null},"institutions":[{"id":"https://openalex.org/I891521709","display_name":"Daimler (Germany)","ror":"https://ror.org/00m0j3d84","country_code":"DE","type":"company","lineage":["https://openalex.org/I891521709"]},{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Ulrich Laube","raw_affiliation_strings":["Fachbereich Informatik, Technische Universit\u00e4t Kaiserslautern, Gottlieb-Daimler-Stra\u00dfe, 67663, Kaiserslautern, Germany","Fachbereich Informatik, Technische Universit\u00e4t Kaiserslautern, Kaiserslautern, Germany 67663#TAB#"],"affiliations":[{"raw_affiliation_string":"Fachbereich Informatik, Technische Universit\u00e4t Kaiserslautern, Gottlieb-Daimler-Stra\u00dfe, 67663, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046","https://openalex.org/I891521709"]},{"raw_affiliation_string":"Fachbereich Informatik, Technische Universit\u00e4t Kaiserslautern, Kaiserslautern, Germany 67663#TAB#","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024961278","display_name":"Markus E. Nebel","orcid":null},"institutions":[{"id":"https://openalex.org/I891521709","display_name":"Daimler (Germany)","ror":"https://ror.org/00m0j3d84","country_code":"DE","type":"company","lineage":["https://openalex.org/I891521709"]},{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus E. Nebel","raw_affiliation_strings":["Fachbereich Informatik, Technische Universit\u00e4t Kaiserslautern, Gottlieb-Daimler-Stra\u00dfe, 67663, Kaiserslautern, Germany","Fachbereich Informatik, Technische Universit\u00e4t Kaiserslautern, Kaiserslautern, Germany 67663#TAB#"],"affiliations":[{"raw_affiliation_string":"Fachbereich Informatik, Technische Universit\u00e4t Kaiserslautern, Gottlieb-Daimler-Stra\u00dfe, 67663, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046","https://openalex.org/I891521709"]},{"raw_affiliation_string":"Fachbereich Informatik, Technische Universit\u00e4t Kaiserslautern, Kaiserslautern, Germany 67663#TAB#","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038195059"],"corresponding_institution_ids":["https://openalex.org/I153267046","https://openalex.org/I891521709"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3638,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.65936618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"74","issue":"4","first_page":"1224","last_page":"1266"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6547192335128784},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5748915076255798},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4936889111995697},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4485251009464264},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.43800872564315796},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.43428438901901245},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4113258421421051},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3718050718307495},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3710139989852905},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3521556854248047},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31054815649986267},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18025752902030945}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6547192335128784},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5748915076255798},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4936889111995697},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4485251009464264},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.43800872564315796},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.43428438901901245},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4113258421421051},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3718050718307495},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3710139989852905},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3521556854248047},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31054815649986267},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18025752902030945},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-015-9998-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-015-9998-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pub.librecat.org:2909992","is_oa":false,"landing_page_url":"https://pub.uni-bielefeld.de/record/2909992","pdf_url":null,"source":{"id":"https://openalex.org/S4306401671","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Laube U, Nebel M. Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs. <em>Algorithmica</em>. 2016;74(4):1224--1266.","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W186403072","https://openalex.org/W564448149","https://openalex.org/W630423399","https://openalex.org/W1549364818","https://openalex.org/W1890888469","https://openalex.org/W1964119857","https://openalex.org/W1981663184","https://openalex.org/W1983383464","https://openalex.org/W1986096063","https://openalex.org/W1993449345","https://openalex.org/W2053923031","https://openalex.org/W2061048794","https://openalex.org/W2085049270","https://openalex.org/W2093913026","https://openalex.org/W2099463627","https://openalex.org/W2142702167","https://openalex.org/W2147388619","https://openalex.org/W2149342630","https://openalex.org/W2301248961","https://openalex.org/W2340541605","https://openalex.org/W2396145993","https://openalex.org/W2504767107","https://openalex.org/W2752853835","https://openalex.org/W2798016460","https://openalex.org/W2905110430","https://openalex.org/W3044238769","https://openalex.org/W4252973173","https://openalex.org/W4285719527","https://openalex.org/W4312512934"],"related_works":["https://openalex.org/W4250775169","https://openalex.org/W4309231192","https://openalex.org/W2064563243","https://openalex.org/W3165104833","https://openalex.org/W2595158997","https://openalex.org/W2018678701","https://openalex.org/W2753425608","https://openalex.org/W2370815826","https://openalex.org/W4249573192","https://openalex.org/W2433057514"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}