{"id":"https://openalex.org/W1604537772","doi":"https://doi.org/10.1002/(sici)1098-2418(200001)16:1<33::aid-rsa3>3.0.co;2-0","title":"Average-case complexity of shortest-paths problems in the vertex-potential model","display_name":"Average-case complexity of shortest-paths problems in the vertex-potential model","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W1604537772","doi":"https://doi.org/10.1002/(sici)1098-2418(200001)16:1<33::aid-rsa3>3.0.co;2-0","mag":"1604537772"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1098-2418(200001)16:1<33::aid-rsa3>3.0.co;2-0","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1098-2418(200001)16:1<33::aid-rsa3>3.0.co;2-0","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","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/A5022238950","display_name":"Colin Cooper","orcid":"https://orcid.org/0000-0002-5264-4401"},"institutions":[{"id":"https://openalex.org/I126193024","display_name":"London Metropolitan University","ror":"https://ror.org/00ae33288","country_code":"GB","type":"education","lineage":["https://openalex.org/I126193024"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Colin Cooper","raw_affiliation_strings":["School of Mathematical Sciences, University of North London, N7 8DB, London, UK"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, University of North London, N7 8DB, London, UK","institution_ids":["https://openalex.org/I126193024"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["DE","US"],"is_corresponding":false,"raw_author_name":"Alan Frieze","raw_affiliation_strings":["Department of Mathematical Sciences, Carnegie Mellon University, 15213, Pittsburgh, PA, USA","Max-Planck-Society"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Carnegie Mellon University, 15213, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Max-Planck-Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010961023","display_name":"Kurt Mehlhorn","orcid":"https://orcid.org/0000-0003-4020-4334"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kurt Mehlhorn","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Im Stadtwald, D-66123, Saarbrf\u00fcrcken, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Im Stadtwald, D-66123, Saarbrf\u00fcrcken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056708884","display_name":"Volker Priebe","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Volker Priebe","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Im Stadtwald, D-66123, Saarbrf\u00fcrcken, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Im Stadtwald, D-66123, Saarbrf\u00fcrcken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5022238950"],"corresponding_institution_ids":["https://openalex.org/I126193024"],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.0866214,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"16","issue":"1","first_page":"15","last_page":"26"},"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.8406999707221985,"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.8406999707221985,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.05400000140070915,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.04780000075697899,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5418953895568848},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5275986790657043},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.48600253462791443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4680499732494354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41188156604766846},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18923354148864746}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5418953895568848},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5275986790657043},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.48600253462791443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4680499732494354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41188156604766846},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18923354148864746}],"mesh":[],"locations_count":12,"locations":[{"id":"doi:10.1002/(sici)1098-2418(200001)16:1<33::aid-rsa3>3.0.co;2-0","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1098-2418(200001)16:1<33::aid-rsa3>3.0.co;2-0","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","raw_type":"journal-article"},{"id":"doi:10.1007/3-540-63248-4_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-63248-4_2","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.4388","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.4388","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aladdin.cs.cmu.edu/papers/pdfs/y2000/paths.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.25.1937","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.1937","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://tara.unl.ac.uk/~11cooperc/pathnew.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.8237","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.8237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cmu.edu/~af1p/paths.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.64.7289","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.7289","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.kcl.ac.uk/staff/ccooper/store/paths.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.653","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~mehlhorn/ftp/AverageShortestPathVertexPotential.pdf","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:344415","is_oa":false,"landing_page_url":"http://edoc.mpg.de/344415","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), Springer, 15-26 (1997)","raw_type":"Conference-Paper"},{"id":"pmh:oai:edoc.mpg.de:344432","is_oa":false,"landing_page_url":"http://edoc.mpg.de/344432","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Random Structures &amp; Algorithms, v.16, 33-46 (2000)","raw_type":"Article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/c11b2119-4960-4c2a-985e-902f762d6806","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/c11b2119-4960-4c2a-985e-902f762d6806","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cooper , C , Frieze , A , Mehlhorn , K &amp; Priebe , V 2000 , ' Average-case complexity of shortest-paths problems in the vertex-potential model ' , RANDOM STRUCTURES AND ALGORITHMS , vol. 16 , no. 1 , pp. 33 - -46 . https://doi.org/10.1002/(SICI)1098-2418(200001)16:1&lt;33::AID-RSA3&gt;3.0.CO;2-0","raw_type":"article"},{"id":"pmh:oai:pure.mpg.de:item_1330786","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-3334-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Random Structures & Algorithms","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.mpg.de:item_1331489","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-38CD-E","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1426993502","https://openalex.org/W1978757752","https://openalex.org/W1990678352","https://openalex.org/W2010601538","https://openalex.org/W2022980325","https://openalex.org/W2027580688","https://openalex.org/W2030917606","https://openalex.org/W2051213257","https://openalex.org/W2054523876","https://openalex.org/W2057399436","https://openalex.org/W2059014957","https://openalex.org/W2074567977","https://openalex.org/W2084224084","https://openalex.org/W2084623271","https://openalex.org/W2093899598","https://openalex.org/W2133768189","https://openalex.org/W2149342630","https://openalex.org/W2160365857","https://openalex.org/W2164141517","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W4233413206","https://openalex.org/W4241684091"],"related_works":["https://openalex.org/W2059534468","https://openalex.org/W2164214337","https://openalex.org/W1537982455","https://openalex.org/W2893192684","https://openalex.org/W3143097445","https://openalex.org/W2036556874","https://openalex.org/W3149063625","https://openalex.org/W2075543862","https://openalex.org/W2371482997","https://openalex.org/W2073094163","https://openalex.org/W2069295656","https://openalex.org/W3121758909","https://openalex.org/W2366342492","https://openalex.org/W2941531601","https://openalex.org/W1564964551","https://openalex.org/W2125205064","https://openalex.org/W1999545213","https://openalex.org/W2391130892","https://openalex.org/W2167427782","https://openalex.org/W2028341270"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}