{"id":"https://openalex.org/W2026984682","doi":"https://doi.org/10.1109/vtcfall.2013.6692448","title":"Two Block Partitioned Dijkstra Algorithms","display_name":"Two Block Partitioned Dijkstra Algorithms","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W2026984682","doi":"https://doi.org/10.1109/vtcfall.2013.6692448","mag":"2026984682"},"language":"en","primary_location":{"id":"doi:10.1109/vtcfall.2013.6692448","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtcfall.2013.6692448","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 78th Vehicular Technology Conference (VTC Fall)","raw_type":"proceedings-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/A5100604345","display_name":"Xinyu Mao","orcid":"https://orcid.org/0009-0006-3081-1252"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinyu Mao","raw_affiliation_strings":["School of Electrical and Computer Engineering, Peking University, Beijing, China","Sch. of Electr. & Comput. Eng., Peking Univ., Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]},{"raw_affiliation_string":"Sch. of Electr. & Comput. Eng., Peking Univ., Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103008691","display_name":"Yuxin Cheng","orcid":"https://orcid.org/0000-0002-6494-0101"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuxin Cheng","raw_affiliation_strings":["School of Electrical and Computer Engineering, Peking University, Beijing, China","Sch. of Electr. & Comput. Eng., Peking Univ., Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]},{"raw_affiliation_string":"Sch. of Electr. & Comput. Eng., Peking Univ., Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101824600","display_name":"Haige Xiang","orcid":"https://orcid.org/0000-0001-7620-5326"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haige Xiang","raw_affiliation_strings":["School of Electrical and Computer Engineering, Peking University, Beijing, China","Sch. of Electr. & Comput. Eng., Peking Univ., Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]},{"raw_affiliation_string":"Sch. of Electr. & Comput. Eng., Peking Univ., Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20231570"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.08382499,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"58","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9936000108718872,"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/T11106","display_name":"Data Management and Algorithms","score":0.979200005531311,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7686529755592346},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.7461960315704346},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6952927708625793},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6763288974761963},{"id":"https://openalex.org/keywords/block-size","display_name":"Block size","score":0.6448781490325928},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6068739295005798},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.5761539936065674},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49662333726882935},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.4954944849014282},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4544955790042877},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45010608434677124},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.280056893825531},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24963423609733582},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.1296190321445465},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09833434224128723},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.0616186261177063}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7686529755592346},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.7461960315704346},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6952927708625793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6763288974761963},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.6448781490325928},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6068739295005798},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.5761539936065674},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49662333726882935},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.4954944849014282},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4544955790042877},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45010608434677124},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.280056893825531},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24963423609733582},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.1296190321445465},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09833434224128723},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0616186261177063},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/vtcfall.2013.6692448","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtcfall.2013.6692448","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 78th Vehicular Technology Conference (VTC Fall)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1976748131","https://openalex.org/W2043138598","https://openalex.org/W2097736984","https://openalex.org/W2111613656","https://openalex.org/W2141268864","https://openalex.org/W2142325131","https://openalex.org/W2148907454","https://openalex.org/W2160897074","https://openalex.org/W2163038365","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W170547082","https://openalex.org/W2136735429","https://openalex.org/W2587876411","https://openalex.org/W2358332176","https://openalex.org/W4229950834","https://openalex.org/W1587123803","https://openalex.org/W2960956696","https://openalex.org/W633441457","https://openalex.org/W2355399587","https://openalex.org/W1985118543"],"abstract_inverted_index":{"The":[0,11,152],"Dijkstra":[1],"algorithm":[2],"(DA)":[3],"is":[4,14,91,120,127,149,157],"a":[5],"kind":[6],"of":[7,21,114,136,154],"tree":[8,27,47],"search":[9,28,90],"algorithm.":[10],"biggest":[12],"advantage":[13],"that":[15,109,133],"it":[16],"has":[17],"the":[18,35,45,80,110,124,137,146],"smallest":[19],"number":[20,113],"visited":[22,111],"nodes":[23,97,112],"among":[24],"all":[25],"optimal":[26,159],"algorithms.":[29,105,163],"But":[30],"stack":[31,60,125,134],"sizes":[32,135],"required":[33],"by":[34,70],"DA":[36,118,141],"are":[37,53,85,93,142],"always":[38],"too":[39],"large":[40],"to":[41,58,95],"achieve.":[42],"By":[43],"partitioning":[44],"searching":[46],"into":[48],"blocks,":[49],"two":[50],"modified":[51],"algorithms":[52,156],"proposed":[54,155,162],"in":[55,103,160],"this":[56],"article":[57],"shrink":[59],"sizes.":[61],"One,":[62],"serial":[63,115],"block":[64,74,89,116,139],"partitioned":[65,75,117,140],"DA,":[66,76],"searches":[67,77],"blocks":[68,78],"one":[69,88],"one.":[71],"Another,":[72],"parallel":[73,138],"at":[79],"same":[81],"time.":[82],"Radii,":[83],"which":[84],"updated":[86],"when":[87],"finished,":[92],"set":[94],"cut":[96],"with":[98],"metrics":[99],"larger":[100],"than":[101],"them":[102],"both":[104,161],"Simulation":[106],"results":[107],"show":[108],"increase":[119],"very":[121],"limited":[122],"while":[123],"size":[126],"reduced":[128,143,150],"exponentially.":[129],"It":[130],"also":[131],"shows":[132],"exponentially":[144],"and":[145],"processing":[147],"time":[148],"efficiently.":[151],"performance":[153],"kept":[158]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}