{"id":"https://openalex.org/W42546367","doi":"https://doi.org/10.6028/nbs.tn.772","title":"A performance comparison of labeling algorithms for calculating shortest path trees","display_name":"A performance comparison of labeling algorithms for calculating shortest path trees","alternate_titles":[],"publication_year":1973,"publication_date":"1973-01-01","ids":{"openalex":"https://openalex.org/W42546367","doi":"https://doi.org/10.6028/nbs.tn.772","mag":"42546367"},"language":"en","primary_location":{"id":"doi:10.6028/nbs.tn.772","doi":"https://doi.org/10.6028/nbs.tn.772","is_oa":true,"landing_page_url":"https://doi.org/10.6028/nbs.tn.772","pdf_url":"https://doi.org/10.6028/nbs.tn.772","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"National Bureau of Standards","raw_type":"report"},"parent_works":[],"lineage":["https://openalex.org/W42546367"],"child_works_count":0,"type":"report","is_traditional":false,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.6028/nbs.tn.772","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044424686","display_name":"Judith F Gilsinn","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Judith F Gilsinn","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5044424686"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":79,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.98580002784729,"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.98580002784729,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.013299999758601189,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"shortest path tree","score":0.9100000262260437},{"id":"https://openalex.org/keywords/labeling-algorithm","display_name":"labeling algorithm","score":0.7590000033378601},{"id":"https://openalex.org/keywords/single-source-shortest-path","display_name":"single-source shortest path","score":0.7820000052452087},{"id":"https://openalex.org/keywords/network-routing","display_name":"network routing","score":0.6660000085830688},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.800000011920929},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.4659999907016754}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6177538633346558},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5855469703674316},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5349067449569702},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49604377150535583},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2268323302268982},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06600984930992126},{"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.6028/nbs.tn.772","doi":"https://doi.org/10.6028/nbs.tn.772","is_oa":true,"landing_page_url":"https://doi.org/10.6028/nbs.tn.772","pdf_url":"https://doi.org/10.6028/nbs.tn.772","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"National Bureau of Standards","raw_type":"report"}],"best_oa_location":{"id":"doi:10.6028/nbs.tn.772","doi":"https://doi.org/10.6028/nbs.tn.772","is_oa":true,"landing_page_url":"https://doi.org/10.6028/nbs.tn.772","pdf_url":"https://doi.org/10.6028/nbs.tn.772","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"National Bureau of Standards","raw_type":"report"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W42546367.pdf","grobid_xml":"https://content.openalex.org/works/W42546367.grobid-xml"},"referenced_works_count":60,"referenced_works":["https://openalex.org/W178023480","https://openalex.org/W1532922475","https://openalex.org/W1551635709","https://openalex.org/W1639967125","https://openalex.org/W1965469937","https://openalex.org/W1969483458","https://openalex.org/W1970220153","https://openalex.org/W1984579796","https://openalex.org/W1989575783","https://openalex.org/W1997883861","https://openalex.org/W2000558287","https://openalex.org/W2003757877","https://openalex.org/W2007572995","https://openalex.org/W2010945917","https://openalex.org/W2017389942","https://openalex.org/W2023132252","https://openalex.org/W2038530909","https://openalex.org/W2040712217","https://openalex.org/W2043779727","https://openalex.org/W2048941791","https://openalex.org/W2056084425","https://openalex.org/W2056656369","https://openalex.org/W2058605898","https://openalex.org/W2060322444","https://openalex.org/W2078279080","https://openalex.org/W2081890036","https://openalex.org/W2085917651","https://openalex.org/W2089845007","https://openalex.org/W2092723223","https://openalex.org/W2119606130","https://openalex.org/W2120070962","https://openalex.org/W2130644458","https://openalex.org/W2133228819","https://openalex.org/W2137460525","https://openalex.org/W2139805900","https://openalex.org/W2144050074","https://openalex.org/W2149220137","https://openalex.org/W2151842399","https://openalex.org/W2154726961","https://openalex.org/W2158172922","https://openalex.org/W2166551367","https://openalex.org/W2166553701","https://openalex.org/W2166818331","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2296071502","https://openalex.org/W2328979732","https://openalex.org/W2530774274","https://openalex.org/W2586377744","https://openalex.org/W2752908210","https://openalex.org/W3138807513","https://openalex.org/W4236469813","https://openalex.org/W4301880108","https://openalex.org/W6601532352","https://openalex.org/W6608115646","https://openalex.org/W6652428554","https://openalex.org/W6660402058","https://openalex.org/W6721223795","https://openalex.org/W7024999114","https://openalex.org/W7097242923"],"related_works":["https://openalex.org/W2061159212","https://openalex.org/W975973143","https://openalex.org/W2185114784","https://openalex.org/W27247825","https://openalex.org/W127624052","https://openalex.org/W2112513979","https://openalex.org/W841764564","https://openalex.org/W4248634500","https://openalex.org/W7096026965","https://openalex.org/W2100586428"],"abstract_inverted_index":{"Many":[0],"applications":[1],"in":[2,14,27,47,68],"transportation":[3],"and":[4,17,80,86,98],"communication":[5],"require":[6],"the":[7,21,28,48,64,87,102],"calculation":[8],"of":[9,23,34,73,82,90,93,101],"shortest":[10],"routes":[11],"between":[12],"points":[13],"a":[15,40],"network,":[16],"several":[18],"algorithms":[19,67,104],"for":[20],"solution":[22],"this":[24,69],"problem":[25],"exist":[26],"literature.This":[29],"paper":[30],"examines":[31],"one":[32,45],"class":[33,70],"such":[35],"algorithms,":[36],"that":[37],"which":[38,58],"calculates":[39],"short-":[41],"est":[42],"route":[43],"from":[44],"point":[46],"network":[49],"to":[50,62],"all":[51],"other":[52],"intersection":[53],"points.Computer":[54],"data":[55],"handling":[56],"techniques":[57],"can":[59],"be":[60],"used":[61],"improve":[63],"two":[65],"basic":[66],"are":[71,84,95,105],"investigated.Results":[72],"computer":[74,99],"timing":[75],"runs":[76],"on":[77],"various":[78],"types":[79],"sizes":[81],"networks":[83],"compared,":[85],"differences,":[88],"sometimes":[89],"an":[91],"order":[92],"magnitude,":[94],"analyzed.Detailed":[96],"flowcharts":[97],"programs":[100],"tested":[103],"also":[106],"included.":[107]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W42546367","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
