{"id":"https://openalex.org/W2043026158","doi":"https://doi.org/10.1109/icnc.2013.6818153","title":"An improved Thorup shortest paths algorithm with a modified component tree","display_name":"An improved Thorup shortest paths algorithm with a modified component tree","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2043026158","doi":"https://doi.org/10.1109/icnc.2013.6818153","mag":"2043026158"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2013.6818153","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2013.6818153","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Ninth International Conference on Natural Computation (ICNC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5004392326","display_name":"Yusi Wei","orcid":null},"institutions":[{"id":"https://openalex.org/I169016828","display_name":"Shimane University","ror":"https://ror.org/01jaaym28","country_code":"JP","type":"education","lineage":["https://openalex.org/I169016828"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yusi Wei","raw_affiliation_strings":["Information Systems Course, Shimane University, Matsue, Japan","Information Systems Course, Interdisciplinary Graduate, School of Science and Engineering, Shimane University, Matsue, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Systems Course, Shimane University, Matsue, Japan","institution_ids":["https://openalex.org/I169016828"]},{"raw_affiliation_string":"Information Systems Course, Interdisciplinary Graduate, School of Science and Engineering, Shimane University, Matsue, Japan","institution_ids":["https://openalex.org/I169016828"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037560668","display_name":"Shojiro Tanaka","orcid":"https://orcid.org/0000-0003-0846-1912"},"institutions":[{"id":"https://openalex.org/I169016828","display_name":"Shimane University","ror":"https://ror.org/01jaaym28","country_code":"JP","type":"education","lineage":["https://openalex.org/I169016828"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shojiro Tanaka","raw_affiliation_strings":["Information Systems Division, Shimane University, Matsue, Japan","Information Systems Division, Interdisciplinary Graduate, School of Science and Engineering, Shimane University, Matsue, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Systems Division, Shimane University, Matsue, Japan","institution_ids":["https://openalex.org/I169016828"]},{"raw_affiliation_string":"Information Systems Division, Interdisciplinary Graduate, School of Science and Engineering, Shimane University, Matsue, Japan","institution_ids":["https://openalex.org/I169016828"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I169016828"],"apc_list":null,"apc_paid":null,"fwci":0.4696,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56485113,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"43","issue":null,"first_page":"1160","last_page":"1165"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7593622207641602},{"id":"https://openalex.org/keywords/fibonacci-number","display_name":"Fibonacci number","score":0.6558362245559692},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5982429385185242},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5661230087280273},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5264174342155457},{"id":"https://openalex.org/keywords/component","display_name":"Component (thermodynamics)","score":0.5140446424484253},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5056416988372803},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32209500670433044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3207346498966217},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2042791247367859},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20333218574523926},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.08347702026367188},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07439243793487549}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7593622207641602},{"id":"https://openalex.org/C173734053","wikidata":"https://www.wikidata.org/wiki/Q47577","display_name":"Fibonacci number","level":2,"score":0.6558362245559692},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5982429385185242},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5661230087280273},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5264174342155457},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.5140446424484253},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5056416988372803},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32209500670433044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3207346498966217},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2042791247367859},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20333218574523926},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.08347702026367188},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07439243793487549},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2013.6818153","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2013.6818153","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Ninth International Conference on Natural Computation (ICNC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W129381002","https://openalex.org/W1507039213","https://openalex.org/W1567047166","https://openalex.org/W1965680834","https://openalex.org/W1969573308","https://openalex.org/W1986022261","https://openalex.org/W2028503265","https://openalex.org/W2096594665","https://openalex.org/W2099339647","https://openalex.org/W2100586428","https://openalex.org/W2124852572","https://openalex.org/W2126911909","https://openalex.org/W2164485560","https://openalex.org/W2169528473","https://openalex.org/W2169624745","https://openalex.org/W2227753815","https://openalex.org/W3145128584","https://openalex.org/W4230267811","https://openalex.org/W4246219036","https://openalex.org/W4255306344","https://openalex.org/W6689168041"],"related_works":["https://openalex.org/W2795454383","https://openalex.org/W2551890212","https://openalex.org/W2557230772","https://openalex.org/W2920386017","https://openalex.org/W4302325333","https://openalex.org/W4317662907","https://openalex.org/W4316467349","https://openalex.org/W2896847511","https://openalex.org/W2054041134","https://openalex.org/W2126644037"],"abstract_inverted_index":{"This":[0],"paper":[1],"provides":[2],"an":[3],"improved":[4],"Thorup":[5,15,47],"algorithm":[6,16,39,48,52],"which":[7],"modified":[8],"the":[9,13,23,30,35,45,57],"component":[10],"tree":[11],"of":[12,26,60],"original":[14,46],"to":[17,21,34],"make":[18],"it":[19],"able":[20],"maintain":[22],"tentative":[24],"distance":[25],"each":[27],"vertex":[28],"without":[29],"unvisited":[31],"structure.":[32],"According":[33],"experimental":[36],"result,":[37],"our":[38],"showed":[40],"a":[41],"better":[42],"result":[43],"than":[44],"and":[49,66],"Fibonacci-based":[50],"Dijkstra":[51],"in":[53],"practice.":[54],"By":[55],"comparison,":[56],"time":[58],"cost":[59],"query":[61],"is":[62],"reduced":[63],"by":[64],"75.04%":[65],"58.26%,":[67],"respectively.":[68]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}