{"id":"https://openalex.org/W4407423345","doi":"https://doi.org/10.3103/s0146411624700226","title":"The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph","display_name":"The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph","publication_year":2024,"publication_date":"2024-12-01","ids":{"openalex":"https://openalex.org/W4407423345","doi":"https://doi.org/10.3103/s0146411624700226"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411624700226","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411624700226","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","raw_type":"journal-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/A5019524013","display_name":"\u0410. \u0412. \u0421\u043c\u0438\u0440\u043d\u043e\u0432","orcid":"https://orcid.org/0000-0002-0980-2507"},"institutions":[{"id":"https://openalex.org/I198371094","display_name":"Yaroslavl State University","ror":"https://ror.org/044s2fj67","country_code":"RU","type":"education","lineage":["https://openalex.org/I198371094"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"A. V. Smirnov","raw_affiliation_strings":["Demidov Yaroslavl State University, 150003, Yaroslavl, Russia"],"raw_orcid":"https://orcid.org/0000-0002-0980-2507","affiliations":[{"raw_affiliation_string":"Demidov Yaroslavl State University, 150003, Yaroslavl, Russia","institution_ids":["https://openalex.org/I198371094"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019524013"],"corresponding_institution_ids":["https://openalex.org/I198371094"],"apc_list":null,"apc_paid":null,"fwci":0.2815,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.55979404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"58","issue":"7","first_page":"745","last_page":"752"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9829999804496765,"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.9829999804496765,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9664999842643738,"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"}},{"id":"https://openalex.org/T12601","display_name":"Web Applications and Data Management","score":0.9438999891281128,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/computer-science","display_name":"Computer science","score":0.8755051493644714},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6045856475830078},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47835153341293335},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47242820262908936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4579126238822937},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4344734847545624},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4284569025039673},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4278855323791504},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4173336327075958},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34365251660346985},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11340609192848206}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8755051493644714},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6045856475830078},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47835153341293335},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47242820262908936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4579126238822937},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4344734847545624},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4284569025039673},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4278855323791504},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4173336327075958},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34365251660346985},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11340609192848206}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3103/s0146411624700226","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411624700226","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2141461755","https://openalex.org/W2169528473","https://openalex.org/W2222512263","https://openalex.org/W2922839089","https://openalex.org/W4392188938"],"related_works":["https://openalex.org/W2363342665","https://openalex.org/W4405632291","https://openalex.org/W2379804627","https://openalex.org/W2372677512","https://openalex.org/W2359532380","https://openalex.org/W2990531685","https://openalex.org/W2354846196","https://openalex.org/W4310124294","https://openalex.org/W2170980056","https://openalex.org/W2886722595"],"abstract_inverted_index":{"Abstract":[0],"In":[1,166],"the":[2,33,83,97,107,121,125,136,139,157,169,175,188,194],"article,":[3,168],"we":[4,118],"consider":[5],"undirected":[6],"multiple":[7,17,26,67,76,132,146,162,181,202],"graphs":[8],"of":[9,21,32,40,86,90,100,110,124,127,138,151,160],"any":[10,201],"natural":[11],"multiplicity":[12],"k":[13,41,87,152],">":[14],"1.":[15],"A":[16],"graph":[18,133,182],"contains":[19],"edges":[20,55,89,159],"three":[22],"types:":[23],"ordinary":[24,116,153],"edges,":[25,27,43,77],"and":[28,78,134,163],"multiedges.":[29],"Each":[30],"edge":[31,129],"last":[34],"two":[35,143],"types":[36],"is":[37,63,96,148,183,191,198],"a":[38,61,66,91,94,101,131,149],"union":[39,150],"linked":[42,54,88,158],"which":[44],"connect":[45],"2":[46],"or":[47],"(k":[48],"+":[49],"1)":[50],"vertices,":[51],"correspondingly.":[52],"The":[53],"should":[56],"be":[57,72,82,106],"used":[58],"simultaneously.":[59],"If":[60,93],"vertex":[62,95],"incident":[64,73],"to":[65,74],"edge,":[68],"then":[69,103],"it":[70,79,104],"can":[71,80,119],"other":[75],"also":[81],"common":[84,98,108],"end":[85,99,109],"multiedge.":[92,112],"multiedge,":[102],"cannot":[105],"another":[111],"As":[113],"for":[114,130,173,200],"an":[115,128,179],"graph,":[117],"define":[120],"integer":[122],"function":[123],"length":[126],"set":[135],"problem":[137,197],"shortest":[140,176,195],"path":[141,147,177,196],"joining":[142],"vertices.":[144],"Any":[145],"paths":[154],"adjusted":[155],"on":[156],"all":[161],"multiedge":[164],"edges.":[165],"this":[167],"previously":[170],"obtained":[171],"algorithm":[172,190],"finding":[174],"in":[178],"arbitrary":[180],"optimized.":[184],"We":[185],"show":[186],"that":[187],"optimized":[189],"polynomial.":[192],"Thus,":[193],"polynomial":[199],"graph.":[203]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}