{"id":"https://openalex.org/W3205035283","doi":"https://doi.org/10.1117/12.2615295","title":"Improved Dijkstra algorithm based on a new storage method","display_name":"Improved Dijkstra algorithm based on a new storage method","alternate_titles":[],"publication_year":2021,"publication_date":"2021-10-15","ids":{"openalex":"https://openalex.org/W3205035283","doi":"https://doi.org/10.1117/12.2615295","mag":"3205035283"},"language":"en","primary_location":{"id":"doi:10.1117/12.2615295","doi":"https://doi.org/10.1117/12.2615295","is_oa":false,"landing_page_url":"https://doi.org/10.1117/12.2615295","pdf_url":null,"source":{"id":"https://openalex.org/S4363608525","display_name":"International Conference on Neural Networks, Information and Communication Engineering (NNICE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 International Conference on Neural Networks, Information and Communication Engineering","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W3205035283"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5108814327","display_name":"Junjie Wang","orcid":"https://orcid.org/0000-0002-9941-6713","observed_orcids":["https://orcid.org/0000-0002-9941-6713"]},"institutions":[{"id":"https://openalex.org/I5343935","display_name":"Guilin University of Electronic Technology","ror":"https://ror.org/05arjae42","country_code":"CN","type":"education","lineage":["https://openalex.org/I5343935"]}],"countries":["CN"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Junjie Wang","raw_affiliation_strings":["Guilin Univ. of Electronic Technology (China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Guilin Univ. of Electronic Technology (China)","institution_ids":["https://openalex.org/I5343935"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054600409","display_name":"Yingqiao Liu","orcid":"https://orcid.org/0000-0002-8513-1805","observed_orcids":["https://orcid.org/0000-0002-8513-1805"]},"institutions":[{"id":"https://openalex.org/I5343935","display_name":"Guilin University of Electronic Technology","ror":"https://ror.org/05arjae42","country_code":"CN","type":"education","lineage":["https://openalex.org/I5343935"]}],"countries":["CN"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Yingqiao Liu","raw_affiliation_strings":["Guilin Univ. of Electronic Technology (China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Guilin Univ. of Electronic Technology (China)","institution_ids":["https://openalex.org/I5343935"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Bo Tang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I5343935","display_name":"Guilin University of Electronic Technology","ror":"https://ror.org/05arjae42","country_code":"CN","type":"education","lineage":["https://openalex.org/I5343935"]}],"countries":["CN"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Bo Tang","raw_affiliation_strings":["Guilin Univ. of Electronic Technology (China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Guilin Univ. of Electronic Technology (China)","institution_ids":["https://openalex.org/I5343935"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089855815","display_name":"Xiaoling Jin","orcid":"https://orcid.org/0000-0003-1277-2844","observed_orcids":["https://orcid.org/0000-0003-1277-2844"]},"institutions":[{"id":"https://openalex.org/I5343935","display_name":"Guilin University of Electronic Technology","ror":"https://ror.org/05arjae42","country_code":"CN","type":"education","lineage":["https://openalex.org/I5343935"]}],"countries":["CN"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Xiaoling Jin","raw_affiliation_strings":["Guilin Univ. of Electronic Technology (China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Guilin Univ. of Electronic Technology (China)","institution_ids":["https://openalex.org/I5343935"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046618429","display_name":"Yang Xiao","orcid":"https://orcid.org/0000-0001-8549-6794","observed_orcids":["https://orcid.org/0000-0001-8549-6794","https://orcid.org/0009-0002-9648-8372"]},"institutions":[{"id":"https://openalex.org/I5343935","display_name":"Guilin University of Electronic Technology","ror":"https://ror.org/05arjae42","country_code":"CN","type":"education","lineage":["https://openalex.org/I5343935"]}],"countries":["CN"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Yang Xiao","raw_affiliation_strings":["Guilin Univ. of Electronic Technology (China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Guilin Univ. of Electronic Technology (China)","institution_ids":["https://openalex.org/I5343935"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I5343935"],"apc_list":null,"apc_paid":null,"fwci":0.183,"has_fulltext":false,"cited_by_count":2,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.25558739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"97","last_page":"97"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.5692999958992004,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.5692999958992004,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4293999969959259,"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/T11269","display_name":"Algorithms and Data Compression","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.9330000281333923},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.8080000281333923},{"id":"https://openalex.org/keywords/graph-representation","display_name":"graph representation","score":0.6140000224113464},{"id":"https://openalex.org/keywords/large-graphs","display_name":"large-scale graphs","score":0.8209999799728394},{"id":"https://openalex.org/keywords/path-planning","display_name":"path planning","score":0.6940000057220459},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"resource allocation","score":0.8539999723434448}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.9190863370895386},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.8492293357849121},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.7716156244277954},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.7602688074111938},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.708397388458252},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7033588886260986},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6998733282089233},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6958610415458679},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.6708009839057922},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5679747462272644},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.505465030670166},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4891074299812317},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43335071206092834},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.42167091369628906},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39380770921707153},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24144327640533447},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20828112959861755},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"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.1117/12.2615295","doi":"https://doi.org/10.1117/12.2615295","is_oa":false,"landing_page_url":"https://doi.org/10.1117/12.2615295","pdf_url":null,"source":{"id":"https://openalex.org/S4363608525","display_name":"International Conference on Neural Networks, Information and Communication Engineering (NNICE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 International Conference on Neural Networks, Information and Communication Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W253507490","https://openalex.org/W1517411378","https://openalex.org/W1858782747","https://openalex.org/W1994777125","https://openalex.org/W2165049137","https://openalex.org/W2561843528"],"related_works":["https://openalex.org/W2348177054","https://openalex.org/W2381351584","https://openalex.org/W2376387406","https://openalex.org/W2348033017","https://openalex.org/W2361669028","https://openalex.org/W2347883311","https://openalex.org/W2386991836","https://openalex.org/W2383983084","https://openalex.org/W2387829241","https://openalex.org/W2972659363"],"abstract_inverted_index":{"Shortest":[0],"path":[1,16,26],"algorithm":[2,39,53,76],"is":[3,19,77],"the":[4,24,32,48,51,60,63,67,81,90],"basis":[5],"of":[6,50,62,94],"many":[7],"optimization":[8],"problems":[9],"such":[10],"as":[11],"resource":[12],"allocation":[13],"and":[14,92],"optimal":[15],"planning.":[17],"It":[18],"very":[20],"meaningful":[21],"to":[22,54],"study":[23],"shortest":[25],"algorithm,":[27],"because":[28],"it":[29],"can":[30],"reflect":[31],"efficiency.":[33],"We":[34,84],"propose":[35],"an":[36,86],"improved":[37,75],"Dijkstra":[38,52],"based":[40],"on":[41],"a":[42,55],"new":[43],"storage":[44],"method,":[45],"which":[46],"improves":[47],"shortcomings":[49],"certain":[56],"extent":[57],"by":[58,66],"constructing":[59],"map":[61],"forward":[64],"star":[65],"chain.":[68],"The":[69],"experimental":[70],"results":[71],"show":[72],"that":[73],"our":[74],"more":[78],"effective":[79,87],"than":[80],"classical":[82],"algorithm.":[83],"provide":[85],"method":[88],"for":[89],"analysis":[91],"application":[93],"actual":[95],"large":[96],"graph":[97],"theory":[98],"problems.":[99]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3205035283","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2021-10-25T00:00:00"}
