{"id":"https://openalex.org/W2146277434","doi":"https://doi.org/10.1002/net.3230080203","title":"A mean\u2010time comparison of algorithms for the all\u2010pairs shortest\u2010path problem with arbitrary arc lengths","display_name":"A mean\u2010time comparison of algorithms for the all\u2010pairs shortest\u2010path problem with arbitrary arc lengths","publication_year":1978,"publication_date":"1978-06-01","ids":{"openalex":"https://openalex.org/W2146277434","doi":"https://doi.org/10.1002/net.3230080203","mag":"2146277434"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230080203","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080203","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"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":"Networks","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/A5028859712","display_name":"W. David Kelton","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"W. D. Kelton","raw_affiliation_strings":["University of Wisconsin Madison, Wisconsin","University of Wisconsin , Madison, Wisconsin,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin Madison, Wisconsin","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"University of Wisconsin , Madison, Wisconsin,","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112327310","display_name":"Averill M. Law","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. M. Law","raw_affiliation_strings":["University of Wisconsin Madison, Wisconsin","University of Wisconsin , Madison, Wisconsin,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin Madison, Wisconsin","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"University of Wisconsin , Madison, Wisconsin,","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028859712"],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":7.5056,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.96501854,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"8","issue":"2","first_page":"97","last_page":"106"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9664999842643738,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10264","display_name":"Asphalt Pavement Performance Evaluation","score":0.9559000134468079,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7066852450370789},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6920959949493408},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.6534290909767151},{"id":"https://openalex.org/keywords/arc-length","display_name":"Arc length","score":0.6315130591392517},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5499266982078552},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.476176917552948},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4509279131889343},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44741714000701904},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.41960686445236206},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4127088189125061},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3416725993156433},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13922131061553955}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7066852450370789},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6920959949493408},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.6534290909767151},{"id":"https://openalex.org/C22251595","wikidata":"https://www.wikidata.org/wiki/Q670036","display_name":"Arc length","level":3,"score":0.6315130591392517},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5499266982078552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.476176917552948},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4509279131889343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44741714000701904},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.41960686445236206},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4127088189125061},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3416725993156433},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13922131061553955},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230080203","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080203","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"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":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W42546367","https://openalex.org/W178023480","https://openalex.org/W1964416868","https://openalex.org/W2000687208","https://openalex.org/W2007572995","https://openalex.org/W2014265988","https://openalex.org/W2072427509","https://openalex.org/W2144050074","https://openalex.org/W2327724807"],"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/W2388654557","https://openalex.org/W2030169809","https://openalex.org/W2161960576","https://openalex.org/W2102269193","https://openalex.org/W2776102956"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"mean\u2010time":[2],"comparison":[3],"of":[4,7,12,15,32,42,46,59],"the":[5,20,30,33,47],"algorithms":[6],"Floyd,":[8],"Dantzig,":[9],"Tabourier,":[10],"and":[11],"repeated":[13,57],"application":[14,58],"several":[16],"single\u2010source":[17,61],"algorithms,":[18],"for":[19,36],"all\u2010pairs":[21],"shortest\u2010path":[22],"problem":[23],"with":[24],"arbitrary":[25],"arc":[26],"lengths":[27],"clearly":[28],"demonstrates":[29],"superiority":[31],"Tabourier":[34],"procedure":[35],"networks":[37],"in":[38],"which":[39],"an":[40],"average":[41],"at":[43],"least":[44],"25%":[45],"potential":[48],"direct":[49],"arcs":[50],"are":[51],"present.":[52],"For":[53],"very":[54],"sparse":[55],"networks,":[56],"a":[60],"label\u2010correcting":[62],"algorithm":[63],"is":[64],"found":[65],"to":[66],"be":[67],"preferable.":[68]},"counts_by_year":[{"year":2016,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}