{"id":"https://openalex.org/W2114365471","doi":"https://doi.org/10.1007/s00453-007-9063-0","title":"An O(n 3(log\u2009log\u2009n/log\u2009n)5/4) Time Algorithm for All Pairs Shortest Path","display_name":"An O(n 3(log\u2009log\u2009n/log\u2009n)5/4) Time Algorithm for All Pairs Shortest Path","publication_year":2007,"publication_date":"2007-10-02","ids":{"openalex":"https://openalex.org/W2114365471","doi":"https://doi.org/10.1007/s00453-007-9063-0","mag":"2114365471"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9063-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9063-0","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/A5091329448","display_name":"Yijie Han","orcid":"https://orcid.org/0000-0003-1305-6815"},"institutions":[{"id":"https://openalex.org/I75421653","display_name":"University of Missouri\u2013Kansas City","ror":"https://ror.org/01w0d5g70","country_code":"US","type":"education","lineage":["https://openalex.org/I75421653"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yijie Han","raw_affiliation_strings":["School of Computing and Engineering, University of Missouri at Kansas City, 5100 Rockhill Road, Kansas City, MO, 64110, USA","University of Missouri at Kansas City, School of Computing and Engineering, 5100 Rockhill Road, 64110, Kansas City, MO, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing and Engineering, University of Missouri at Kansas City, 5100 Rockhill Road, Kansas City, MO, 64110, USA","institution_ids":["https://openalex.org/I75421653"]},{"raw_affiliation_string":"University of Missouri at Kansas City, School of Computing and Engineering, 5100 Rockhill Road, 64110, Kansas City, MO, USA#TAB#","institution_ids":["https://openalex.org/I75421653"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091329448"],"corresponding_institution_ids":["https://openalex.org/I75421653"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.7404,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.93220135,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"51","issue":"4","first_page":"428","last_page":"434"},"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.9997000098228455,"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.9997000098228455,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/binary-logarithm","display_name":"Binary logarithm","score":0.8705625534057617},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.7769222259521484},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6891695261001587},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5718125700950623},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5629134178161621},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5590335726737976},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5337662696838379},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4163569509983063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4001050591468811},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22149208188056946},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20469176769256592}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.8705625534057617},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.7769222259521484},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6891695261001587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5718125700950623},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5629134178161621},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5590335726737976},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5337662696838379},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4163569509983063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4001050591468811},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22149208188056946},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20469176769256592},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-007-9063-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9063-0","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"}],"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/W98276372","https://openalex.org/W1509653541","https://openalex.org/W1544195453","https://openalex.org/W1547799421","https://openalex.org/W1655990431","https://openalex.org/W1969668378","https://openalex.org/W1999222448","https://openalex.org/W1999545213","https://openalex.org/W2009283111","https://openalex.org/W2021227709","https://openalex.org/W2028341270","https://openalex.org/W2049500052","https://openalex.org/W2058426370","https://openalex.org/W2060919812","https://openalex.org/W2065105907","https://openalex.org/W2072064573","https://openalex.org/W2084224084","https://openalex.org/W2097382431","https://openalex.org/W2136442765","https://openalex.org/W2141389982","https://openalex.org/W2492857469","https://openalex.org/W2753176400","https://openalex.org/W4249958171"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W2887154986","https://openalex.org/W1968512104","https://openalex.org/W78560857"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-10T14:10:52.464848","created_date":"2025-10-10T00:00:00"}