{"id":"https://openalex.org/W2922839089","doi":"https://doi.org/10.3103/s0146411618070234","title":"The Shortest Path Problem for a Multiple Graph","display_name":"The Shortest Path Problem for a Multiple Graph","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2922839089","doi":"https://doi.org/10.3103/s0146411618070234","mag":"2922839089"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411618070234","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411618070234","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, 150000, Yaroslavl, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Demidov Yaroslavl State University, 150000, 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.7903,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.7317691,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"52","issue":"7","first_page":"625","last_page":"633"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13601","display_name":"Urban Transport Systems Analysis","score":0.9498999714851379,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13601","display_name":"Urban Transport Systems Analysis","score":0.9498999714851379,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T14470","display_name":"Advanced Data Processing Techniques","score":0.9157000184059143,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6792497634887695},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.5755589008331299},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5718144774436951},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5513163805007935},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.5318244099617004},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4913419783115387},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48331570625305176},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3452305197715759},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.324169397354126}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6792497634887695},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.5755589008331299},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5718144774436951},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5513163805007935},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5318244099617004},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4913419783115387},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48331570625305176},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3452305197715759},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.324169397354126},{"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/s0146411618070234","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411618070234","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":17,"referenced_works":["https://openalex.org/W33209730","https://openalex.org/W925666063","https://openalex.org/W1530753374","https://openalex.org/W1964119857","https://openalex.org/W2062754819","https://openalex.org/W2088158318","https://openalex.org/W2117115743","https://openalex.org/W2169528473","https://openalex.org/W2540385142","https://openalex.org/W2572716357","https://openalex.org/W2796411867","https://openalex.org/W3124905242","https://openalex.org/W3145128584","https://openalex.org/W4244424643","https://openalex.org/W4246219036","https://openalex.org/W4285719527","https://openalex.org/W6600510208"],"related_works":["https://openalex.org/W2136512912","https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2067910792","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W2889071233","https://openalex.org/W4321471459","https://openalex.org/W2902222102","https://openalex.org/W2900798793"],"abstract_inverted_index":{"In":[0],"the":[1,3,34,39,83,98,107,118,134,143,164,173,175,177,183,193,218,225,230,242,268,281],"article,":[2],"definition":[4,187],"of":[5,10,22,33,41,91,101,110,117,127,166,170,179,188,208,220,241,244],"an":[6,156,180,264],"undirected":[7],"multiple":[8,27,68,77,120,196,222,246,256,273],"graph":[9,135,223],"any":[11,111],"natural":[12],"multiplicity":[13],"$$k":[14,49],">":[15],"1$$":[16,51],"is":[17,38,64,97,122,129,155,198,203,212,252,259],"stated.":[18,199,260],"There":[19],"are":[20,140,162],"edges":[21,56,78,90,145,197],"three":[23],"types:":[24],"ordinary":[25,151,157,194],"edges,":[26,28,44],"and":[29,79,146,182,195,235],"multi-edges.":[30],"Each":[31,153],"edge":[32],"last":[35],"two":[36,249],"types":[37],"union":[40],"$$k$$":[42,88,137],"linked":[43,55,89,144],"which":[45,139,147,286],"connect":[46],"2":[47],"or":[48],"+":[50],"vertices,":[52],"correspondingly.":[53],"The":[54,124,159,186,200,254],"should":[57],"be":[58,72,82,106],"used":[59],"simultaneously.":[60],"If":[61,94],"a":[62,67,95,102,115,130,167,171,189,206,221,245,272],"vertex":[63,86,96],"incident":[65,74],"to":[66,75,87,132,288],"edge,":[69,181],"it":[70,80,104],"can":[71,81,216],"also":[73],"other":[76,112],"common":[84,99,108,150],"ending":[85],"some":[92],"multi-edge.":[93,113],"end":[100,109],"multi-edge,":[103],"cannot":[105],"Also,":[114],"class":[116],"divisible":[119],"graphs":[121],"considered.":[123,253],"main":[125],"peculiarity":[126],"them":[128],"possibility":[131],"divide":[133],"into":[136],"parts,":[138],"adjusted":[141],"on":[142,229],"have":[148],"no":[149],"edges.":[152],"part":[154],"graph.":[158,274],"following":[160],"terms":[161],"generalized:":[163],"degree":[165],"vertex,":[168],"connectedness":[169,219],"graph,":[172],"path,":[174],"cycle,":[176],"weight":[178],"path":[184,247,257,270],"length.":[185],"reachability":[190,209,233,290],"set":[191],"for":[192,205,232,266,279],"adjacency":[201],"property":[202],"defined":[204],"pair":[207],"sets.":[210,291],"It":[211,275],"shown,":[213],"that":[214],"we":[215,262],"check":[217],"with":[224],"polynomial":[226],"algorithm":[227,265,278],"based":[228],"search":[231],"sets":[234],"testing":[236],"their":[237],"adjacency.":[238],"A":[239],"criterion":[240],"existence":[243],"between":[248],"given":[250],"vertices":[251],"shortest":[255,269,282],"problem":[258],"Then,":[261],"suggest":[263],"finding":[267,280],"in":[271,284],"uses":[276],"Dijkstra\u2019s":[277],"paths":[283],"subgraphs,":[285],"correspond":[287],"different":[289]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}