{"id":"https://openalex.org/W2053609728","doi":"https://doi.org/10.1007/s00453-004-1122-1","title":"A Branch-Checking Algorithm for All-Pairs Shortest Paths","display_name":"A Branch-Checking Algorithm for All-Pairs Shortest Paths","publication_year":2004,"publication_date":"2004-10-15","ids":{"openalex":"https://openalex.org/W2053609728","doi":"https://doi.org/10.1007/s00453-004-1122-1","mag":"2053609728"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-004-1122-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1122-1","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/A5008573711","display_name":"C.W. Duin","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Cees Duin","raw_affiliation_strings":["AKE, Faculteit Econometrie en Economie,\nUniversiteitvan Amsterdam,\nRoetersstraat 11, 1018 WB Amsterdam, The Netherlands","AKE, Faculteit Econometrie en Economie,#N#Universiteitvan Amsterdam,#N#Roetersstraat 11, 1018 WB Amsterdam"],"affiliations":[{"raw_affiliation_string":"AKE, Faculteit Econometrie en Economie,\nUniversiteitvan Amsterdam,\nRoetersstraat 11, 1018 WB Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]},{"raw_affiliation_string":"AKE, Faculteit Econometrie en Economie,#N#Universiteitvan Amsterdam,#N#Roetersstraat 11, 1018 WB Amsterdam","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008573711"],"corresponding_institution_ids":["https://openalex.org/I887064364"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3484,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.62024557,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"41","issue":"2","first_page":"131","last_page":"145"},"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.9994999766349792,"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.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7502775192260742},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6680407524108887},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5936248898506165},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5461304783821106},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5401685237884521},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5237614512443542},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49163132905960083},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.47779425978660583},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46219995617866516},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.43396320939064026},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.42449724674224854},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4104308485984802},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3280613124370575},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2861579656600952},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18580231070518494},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07073009014129639}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7502775192260742},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6680407524108887},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5936248898506165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5461304783821106},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5401685237884521},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5237614512443542},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49163132905960083},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.47779425978660583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46219995617866516},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.43396320939064026},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.42449724674224854},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4104308485984802},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3280613124370575},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2861579656600952},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18580231070518494},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07073009014129639},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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-004-1122-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1122-1","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1964119857","https://openalex.org/W2007572995","https://openalex.org/W2059014957","https://openalex.org/W2062266989","https://openalex.org/W2084224084","https://openalex.org/W2093899598","https://openalex.org/W2133768189","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2338905098","https://openalex.org/W3138807513"],"related_works":["https://openalex.org/W4293054712","https://openalex.org/W2360981904","https://openalex.org/W2198982833","https://openalex.org/W2375775343","https://openalex.org/W2366342492","https://openalex.org/W2357391150","https://openalex.org/W2365712669","https://openalex.org/W2358754422","https://openalex.org/W2237480599","https://openalex.org/W2159815887"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}