{"id":"https://openalex.org/W4283732931","doi":"https://doi.org/10.1109/codit55151.2022.9804024","title":"Optimization Possibilities for the Shortest-Path Algorithms in the Context of Large Volumes of Information","display_name":"Optimization Possibilities for the Shortest-Path Algorithms in the Context of Large Volumes of Information","publication_year":2022,"publication_date":"2022-05-17","ids":{"openalex":"https://openalex.org/W4283732931","doi":"https://doi.org/10.1109/codit55151.2022.9804024"},"language":"en","primary_location":{"id":"doi:10.1109/codit55151.2022.9804024","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit55151.2022.9804024","pdf_url":null,"source":{"id":"https://openalex.org/S4363607900","display_name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","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/A5033795419","display_name":"Bogdan Popa","orcid":"https://orcid.org/0009-0000-3155-045X"},"institutions":[{"id":"https://openalex.org/I97553796","display_name":"University of Craiova","ror":"https://ror.org/03s251g81","country_code":"RO","type":"education","lineage":["https://openalex.org/I97553796"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Bogdan Popa","raw_affiliation_strings":["University of Craiova,Department of Automation and Electronics,Craiova,Romania","Department of Automation and Electronics, University of Craiova, Craiova, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Craiova,Department of Automation and Electronics,Craiova,Romania","institution_ids":["https://openalex.org/I97553796"]},{"raw_affiliation_string":"Department of Automation and Electronics, University of Craiova, Craiova, Romania","institution_ids":["https://openalex.org/I97553796"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051223030","display_name":"Dan Seli\u0219teanu","orcid":"https://orcid.org/0000-0002-9770-405X"},"institutions":[{"id":"https://openalex.org/I97553796","display_name":"University of Craiova","ror":"https://ror.org/03s251g81","country_code":"RO","type":"education","lineage":["https://openalex.org/I97553796"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Dan Selisteanu","raw_affiliation_strings":["University of Craiova,Department of Automation and Electronics,Craiova,Romania","Department of Automation and Electronics, University of Craiova, Craiova, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Craiova,Department of Automation and Electronics,Craiova,Romania","institution_ids":["https://openalex.org/I97553796"]},{"raw_affiliation_string":"Department of Automation and Electronics, University of Craiova, Craiova, Romania","institution_ids":["https://openalex.org/I97553796"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061552882","display_name":"Alexandra Elisabeta L\u00f6rincz","orcid":null},"institutions":[{"id":"https://openalex.org/I97553796","display_name":"University of Craiova","ror":"https://ror.org/03s251g81","country_code":"RO","type":"education","lineage":["https://openalex.org/I97553796"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Alexandra Elisabeta Lorincz","raw_affiliation_strings":["University of Craiova,Department of Automation and Electronics,Craiova,Romania","Department of Automation and Electronics, University of Craiova, Craiova, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Craiova,Department of Automation and Electronics,Craiova,Romania","institution_ids":["https://openalex.org/I97553796"]},{"raw_affiliation_string":"Department of Automation and Electronics, University of Craiova, Craiova, Romania","institution_ids":["https://openalex.org/I97553796"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069295178","display_name":"Tudosie Robert","orcid":null},"institutions":[{"id":"https://openalex.org/I97553796","display_name":"University of Craiova","ror":"https://ror.org/03s251g81","country_code":"RO","type":"education","lineage":["https://openalex.org/I97553796"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Tudosie Robert","raw_affiliation_strings":["University of Craiova,Department of Automation and Electronics,Craiova,Romania","Department of Automation and Electronics, University of Craiova, Craiova, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Craiova,Department of Automation and Electronics,Craiova,Romania","institution_ids":["https://openalex.org/I97553796"]},{"raw_affiliation_string":"Department of Automation and Electronics, University of Craiova, Craiova, Romania","institution_ids":["https://openalex.org/I97553796"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0368272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"361","last_page":"366"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9979000091552734,"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.9979000091552734,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9871000051498413,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.928459644317627},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7462475299835205},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7357796430587769},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5317662358283997},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5274914503097534},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5010156631469727},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47535961866378784},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.4739254415035248},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4692416489124298},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.46538060903549194},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4585871398448944},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4348601698875427},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.41057878732681274},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0777517557144165}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.928459644317627},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7462475299835205},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7357796430587769},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5317662358283997},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5274914503097534},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5010156631469727},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47535961866378784},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.4739254415035248},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4692416489124298},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.46538060903549194},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4585871398448944},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4348601698875427},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.41057878732681274},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0777517557144165},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit55151.2022.9804024","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit55151.2022.9804024","pdf_url":null,"source":{"id":"https://openalex.org/S4363607900","display_name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1520896331","https://openalex.org/W1611975322","https://openalex.org/W2164399552","https://openalex.org/W2473509099","https://openalex.org/W2809729279","https://openalex.org/W2914457042","https://openalex.org/W2948255865","https://openalex.org/W2964161665","https://openalex.org/W2969026503","https://openalex.org/W3084957793","https://openalex.org/W3116143294","https://openalex.org/W3126071518","https://openalex.org/W3194459689","https://openalex.org/W6636285781"],"related_works":["https://openalex.org/W2810620529","https://openalex.org/W3183360588","https://openalex.org/W2372677512","https://openalex.org/W2387829241","https://openalex.org/W2374583081","https://openalex.org/W2376231728","https://openalex.org/W2095579929","https://openalex.org/W2384089948","https://openalex.org/W2757201630","https://openalex.org/W2140996842"],"abstract_inverted_index":{"The":[0,66,119],"purpose":[1,11],"of":[2,20,35],"this":[3],"research":[4,23],"article":[5,94],"is":[6,44,95,126],"to":[7,97],"create":[8],"an":[9,30],"optimized":[10],"for":[12,73,111,121],"the":[13,27,36,70,80,88,93,108,112,123,131],"Dijkstra":[14],"algorithm,":[15],"with":[16,56,59,79,114],"a":[17,57,60,98],"superior":[18],"degree":[19],"efficiency.":[21],"This":[22,41],"proposes":[24],"also,":[25],"in":[26,46,92,134],"first":[28],"instance,":[29],"innovative":[31],"and":[32,38,77,117,128,137],"efficient":[33],"analysis":[34,67],"Dijkstra's":[37],"Roy-Floyd":[39],"algorithms.":[40],"proposed":[42,91],"method":[43],"useful":[45],"various":[47],"application":[48],"cases,":[49],"such":[50],"as":[51],"information":[52],"grouping":[53,109],"systems":[54,110],"associated":[55],"graph":[58],"small":[61],"but":[62],"high":[63],"node":[64],"density.":[65],"part":[68],"explains":[69],"strategies":[71,106],"chosen":[72],"today's":[74],"parallel":[75],"solutions":[76],"comparisons":[78],"implemented":[81],"method.":[82],"It":[83],"can":[84],"be":[85,102],"stated":[86],"that":[87],"parallelization":[89],"solution":[90],"specific":[96],"configuration.":[99],"There":[100],"will":[101],"also":[103],"presented":[104,127],"other":[105],"considering":[107],"tests":[113],"many":[115],"nodes":[116],"edges.":[118],"algorithm":[120],"determining":[122],"shortest":[124],"path":[125],"tested":[129],"at":[130],"multi-language":[132],"level":[133],"different":[135],"contexts":[136],"scenarios.":[138]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}