{"id":"https://openalex.org/W4407423335","doi":"https://doi.org/10.3103/s0146411624700342","title":"The Algorithms for the Eulerian Cycle and Eulerian Trail Problems for a Multiple Graph","display_name":"The Algorithms for the Eulerian Cycle and Eulerian Trail Problems for a Multiple Graph","publication_year":2024,"publication_date":"2024-12-01","ids":{"openalex":"https://openalex.org/W4407423335","doi":"https://doi.org/10.3103/s0146411624700342"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411624700342","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411624700342","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.2044,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53343758,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"58","issue":"7","first_page":"889","last_page":"903"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9987000226974487,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9842000007629395,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/eulerian-path","display_name":"Eulerian path","score":0.906945526599884},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8197488784790039},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4850851595401764},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4769529104232788},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39588454365730286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12843692302703857},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.08266064524650574}],"concepts":[{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.906945526599884},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8197488784790039},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4850851595401764},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4769529104232788},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39588454365730286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12843692302703857},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.08266064524650574},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3103/s0146411624700342","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411624700342","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":16,"referenced_works":["https://openalex.org/W11818456","https://openalex.org/W1973343935","https://openalex.org/W2000675444","https://openalex.org/W2085206979","https://openalex.org/W2117115743","https://openalex.org/W2540385142","https://openalex.org/W2572716357","https://openalex.org/W2577446513","https://openalex.org/W2922839089","https://openalex.org/W3124905242","https://openalex.org/W3203586695","https://openalex.org/W4213214460","https://openalex.org/W4246219036","https://openalex.org/W4321360132","https://openalex.org/W4392188938","https://openalex.org/W4407423345"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4366835705","https://openalex.org/W2051487156","https://openalex.org/W2034363746","https://openalex.org/W4399505169","https://openalex.org/W2008097580","https://openalex.org/W2073681303","https://openalex.org/W2930989993"],"abstract_inverted_index":{"Abstract":[0],"In":[1,164,234],"this":[2,324],"article,":[3],"we":[4],"consider":[5],"undirected":[6],"multiple":[7,17,26,67,76,129,151,190,199,211,241,300,312],"graphs":[8],"of":[9,21,32,40,86,90,100,110,117,143,145,173,175,205,226,265,310,330,332],"any":[10],"natural":[11],"multiplicity":[12],"k":[13,41,87],">":[14],"1.":[15],"A":[16],"graph":[18,152,200,212,219,229,242,250,259,277],"contains":[19],"edges":[20,43,55,89],"three":[22],"types:":[23],"ordinary":[24,138,218,276],"edges,":[25,27,77],"and":[28,78,179,281],"multiedges.":[29],"Each":[30],"edge":[31],"the":[33,83,97,107,115,119,125,133,170,217,224,227,240,245,249,267,271,291,295,307,327],"last":[34],"two":[35,203,282],"types":[36,204],"is":[37,63,96,156,167,194,260,278,317,320],"a":[38,61,66,91,94,101,128,150,198,231,258,299,311,314],"union":[39],"linked":[42,54,88],"that":[44,158,169,322],"connect":[45],"2":[46],"or":[47,124],"(k":[48],"+":[49],"1)":[50],"vertices,":[51],"correspondingly.":[52],"The":[53,140,253,262],"should":[56],"be":[57,72,82,106,214],"used":[58],"simultaneously.":[59,209],"If":[60,93],"vertex":[62,95],"incident":[64,73],"to":[65,74,196,216,244],"edge,":[68],"then":[69,103],"it":[70,79,104,155,166,193,286,319],"can":[71,80,213],"other":[75],"also":[81,279],"common":[84,98,108],"end":[85,99,109],"multiedge.":[92,112],"multiedge,":[102],"cannot":[105],"another":[111],"We":[113,289],"set":[114],"problem":[116,135,264],"finding":[118,266,294],"Eulerian":[120,147,177,181,206,237,246,296,334],"walk":[121,148,238,247,297,335],"(the":[122],"cycle":[123,178],"trail)":[126],"in":[127,149,201,230,239,248,274,298,323],"graph,":[130,301,313],"which":[131,202,222,302],"generalizes":[132],"classical":[134],"for":[136,187,255,284,293],"an":[137,146,176,180,188,275,333],"graph.":[139],"necessary":[141,171,328],"conditions":[142,160,172,329],"existence":[144,174,331],"are":[153,161,183,287,336],"formulated;":[154],"shown":[157,168,321],"these":[159],"not":[162,184],"sufficient.":[163,337],"addition,":[165],"trail":[182],"mutually":[185],"exclusive":[186],"arbitrary":[189],"graph;":[191],"therefore,":[192],"possible":[195],"construct":[197],"walks":[207],"exist":[208],"Any":[210],"juxtaposed":[215],"with":[220,251,270],"quasi-vertices,":[221],"represents":[223],"structure":[225],"initial":[228],"simpler":[232],"form.":[233],"particular,":[235],"each":[236],"corresponds":[243],"quasi-vertices.":[252],"algorithm":[254,292,316],"constructing":[256],"such":[257],"formulated.":[261],"auxiliary":[263],"covering":[268],"trails":[269],"given":[272],"endpoints":[273],"considered,":[280],"algorithms":[283],"solving":[285],"obtained.":[288],"elaborate":[290],"has":[303],"exponential":[304],"complexity.":[305],"For":[306],"special":[308,325],"case":[309,326],"polynomial":[315],"proposed;":[318]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}