{"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.3288,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.60085882,"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":{"grobid_xml":false,"pdf":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":{"In":[0,165],"the":[1,32,82,96,106,120,124,135,138,156,168,174,187,193],"article,":[2,167],"we":[3,117],"consider":[4],"undirected":[5],"multiple":[6,16,25,66,75,131,145,161,180,201],"graphs":[7],"of":[8,20,31,39,85,89,99,109,123,126,137,150,159],"any":[9,200],"natural":[10],"multiplicity":[11],"k":[12,40,86,151],">":[13],"1.":[14],"A":[15],"graph":[17,132,181],"contains":[18],"edges":[19,54,88,158],"three":[21],"types:":[22],"ordinary":[23,115,152],"edges,":[24,26,42,76],"and":[27,77,133,162],"multiedges.":[28],"Each":[29],"edge":[30,128],"last":[33],"two":[34,142],"types":[35],"is":[36,62,95,147,182,190,197],"a":[37,60,65,90,93,100,130,148],"union":[38,149],"linked":[41,53,87,157],"which":[43],"connect":[44],"2":[45],"or":[46],"(k":[47],"+":[48],"1)":[49],"vertices,":[50],"correspondingly.":[51],"The":[52],"should":[55],"be":[56,71,81,105],"used":[57],"simultaneously.":[58],"If":[59,92],"vertex":[61,94],"incident":[63,72],"to":[64,73],"edge,":[67],"then":[68,102],"it":[69,78,103],"can":[70,79,118],"other":[74],"also":[80],"common":[83,97,107],"end":[84,98,108],"multiedge.":[91,111],"multiedge,":[101],"cannot":[104],"another":[110],"As":[112],"for":[113,129,172,199],"an":[114,127,178],"graph,":[116],"define":[119],"integer":[121],"function":[122],"length":[125],"set":[134],"problem":[136,196],"shortest":[139,175,194],"path":[140,146,176,195],"joining":[141],"vertices.":[143],"Any":[144],"paths":[153],"adjusted":[154],"on":[155],"all":[160],"multiedge":[163],"edges.":[164],"this":[166],"previously":[169],"obtained":[170],"algorithm":[171,189],"finding":[173],"in":[177],"arbitrary":[179],"optimized.":[183],"We":[184],"show":[185],"that":[186],"optimized":[188],"polynomial.":[191],"Thus,":[192],"polynomial":[198],"graph.":[202]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2025-10-10T00:00:00"}