{"id":"https://openalex.org/W4392188938","doi":"https://doi.org/10.3103/s0146411623070143","title":"The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph","display_name":"The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph","publication_year":2023,"publication_date":"2023-12-01","ids":{"openalex":"https://openalex.org/W4392188938","doi":"https://doi.org/10.3103/s0146411623070143"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411623070143","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411623070143","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.2615,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.52025484,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"57","issue":"7","first_page":"841","last_page":"853"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9901000261306763,"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.9901000261306763,"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.9900000095367432,"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/T12601","display_name":"Web Applications and Data Management","score":0.9666000008583069,"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.8376521468162537},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6831908226013184},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5276607275009155},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5174301266670227},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4258458614349365},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4230843782424927},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4033240079879761},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16094407439231873},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15203642845153809}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8376521468162537},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6831908226013184},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5276607275009155},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5174301266670227},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4258458614349365},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4230843782424927},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4033240079879761},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16094407439231873},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15203642845153809},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3103/s0146411623070143","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411623070143","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":8,"referenced_works":["https://openalex.org/W2117115743","https://openalex.org/W2169528473","https://openalex.org/W2540385142","https://openalex.org/W2572716357","https://openalex.org/W2922839089","https://openalex.org/W3124905242","https://openalex.org/W3203586695","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W3118505512","https://openalex.org/W2349797546","https://openalex.org/W191849398","https://openalex.org/W2359578922","https://openalex.org/W2996337372","https://openalex.org/W2376911392","https://openalex.org/W2388654557","https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W4301332868"],"abstract_inverted_index":{"Abstract":[0],"In":[1,197],"this":[2,198],"paper,":[3],"we":[4,148,200],"study":[5],"undirected":[6],"multiple":[7,24,65,74,110,162,176,194,214,236],"graphs":[8,111],"of":[9,19,30,38,83,87,97,106,154,157,168,181,192,205,227,233],"any":[10],"natural":[11],"multiplicity":[12],"k":[13,39,84,122,182],">":[14],"1.":[15],"There":[16],"are":[17,112,125,186],"edges":[18,53,75,86,130,191],"three":[20],"types:":[21],"ordinary":[22,141,146,183],"edges,":[23,25,41],"and":[26,76,131,164,195],"multiedges.":[27,196],"Each":[28,137],"edge":[29,159],"the":[31,80,94,103,115,119,128,151,155,166,169,189,203,206,225,228,231,245],"last":[32],"two":[33,173],"types":[34],"is":[35,61,93,139,178,209,220],"a":[36,59,64,91,161,179,212],"union":[37,180],"linked":[40,52,85,129,190],"which":[42,124,132,185],"connect":[43],"2":[44],"or":[45],"(k":[46],"+":[47],"1)":[48],"vertices,":[49],"correspondingly.":[50],"The":[51,216],"should":[54],"be":[55,70,79,102],"used":[56],"simultaneously.":[57],"If":[58,90],"vertex":[60,92],"incident":[62,71],"to":[63,72,117],"edge,":[66],"it":[67,77,100],"can":[68,78,149],"also":[69,223],"other":[73],"common":[81,95,104,135],"end":[82,96,105],"some":[88,98],"multiedge.":[89,108],"multiedge,":[99],"cannot":[101],"another":[107],"Divisible":[109],"characterized":[113],"by":[114],"possibility":[116],"divide":[118],"graph":[120,163],"into":[121],"parts,":[123],"adjusted":[126,187],"on":[127,188],"have":[133],"no":[134],"edges.":[136],"part":[138],"an":[140,145,158,234,241],"graph.":[142,215,237],"As":[143],"for":[144,160,211,230],"graph,":[147],"define":[150],"integer":[152],"function":[153],"length":[156],"set":[165],"problem":[167,204],"shortest":[170,207],"path":[171,177,208],"joining":[172],"vertices.":[174],"Any":[175],"paths,":[184],"all":[193],"article,":[199],"show":[201],"that":[202],"polynomial":[210,218],"divisible":[213],"corresponding":[217],"algorithm":[219,229],"formulated.":[221],"We":[222],"propose":[224],"modification":[226,239],"case":[232],"arbitrary":[235],"This":[238],"has":[240],"exponential":[242],"complexity":[243],"in":[244],"parameter":[246],"k.":[247]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}