{"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.2381,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57208252,"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":{"pdf":false,"grobid_xml":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":{"In":[0,163,233],"this":[1,323],"article,":[2],"we":[3],"consider":[4],"undirected":[5],"multiple":[6,16,25,66,75,128,150,189,198,210,240,299,311],"graphs":[7],"of":[8,20,31,39,85,89,99,109,116,142,144,172,174,204,225,264,309,329,331],"any":[9],"natural":[10],"multiplicity":[11],"k":[12,40,86],">":[13],"1.":[14],"A":[15],"graph":[17,151,199,211,218,228,241,249,258,276],"contains":[18],"edges":[19,42,54,88],"three":[21],"types:":[22],"ordinary":[23,137,217,275],"edges,":[24,26,76],"and":[27,77,178,280],"multiedges.":[28],"Each":[29],"edge":[30],"the":[32,82,96,106,114,118,124,132,169,216,223,226,239,244,248,266,270,290,294,306,326],"last":[33],"two":[34,202,281],"types":[35,203],"is":[36,62,95,155,166,193,259,277,316,319],"a":[37,60,65,90,93,100,127,149,197,230,257,298,310,313],"union":[38],"linked":[41,53,87],"that":[43,157,168,321],"connect":[44],"2":[45],"or":[46,123],"(k":[47],"+":[48],"1)":[49],"vertices,":[50],"correspondingly.":[51],"The":[52,139,252,261],"should":[55],"be":[56,71,81,105,213],"used":[57],"simultaneously.":[58,208],"If":[59,92],"vertex":[61,94],"incident":[63,72],"to":[64,73,195,215,243],"edge,":[67],"then":[68,102],"it":[69,78,103,154,165,192,285,318],"can":[70,79,212],"other":[74],"also":[80,278],"common":[83,97,107],"end":[84,98,108],"multiedge.":[91,111],"multiedge,":[101],"cannot":[104],"another":[110],"We":[112,288],"set":[113],"problem":[115,134,263],"finding":[117,265,293],"Eulerian":[119,146,176,180,205,236,245,295,333],"walk":[120,147,237,246,296,334],"(the":[121],"cycle":[122,177],"trail)":[125],"in":[126,148,200,229,238,247,273,297,322],"graph,":[129,300,312],"which":[130,201,221,301],"generalizes":[131],"classical":[133],"for":[135,186,254,283,292],"an":[136,145,175,179,187,274,332],"graph.":[138],"necessary":[140,170,327],"conditions":[141,159,171,328],"existence":[143,173,330],"are":[152,160,182,286,335],"formulated;":[153],"shown":[156,167,320],"these":[158],"not":[161,183],"sufficient.":[162,336],"addition,":[164],"trail":[181],"mutually":[184],"exclusive":[185],"arbitrary":[188],"graph;":[190],"therefore,":[191],"possible":[194],"construct":[196],"walks":[206],"exist":[207],"Any":[209],"juxtaposed":[214],"with":[219,250,269],"quasi-vertices,":[220],"represents":[222],"structure":[224],"initial":[227],"simpler":[231],"form.":[232],"particular,":[234],"each":[235],"corresponds":[242],"quasi-vertices.":[251],"algorithm":[253,291,315],"constructing":[255],"such":[256],"formulated.":[260],"auxiliary":[262],"covering":[267],"trails":[268],"given":[271],"endpoints":[272],"considered,":[279],"algorithms":[282],"solving":[284],"obtained.":[287],"elaborate":[289],"has":[302],"exponential":[303],"complexity.":[304],"For":[305],"special":[307,324],"case":[308,325],"polynomial":[314],"proposed;":[317]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-21T23:12:01.093139","created_date":"2025-10-10T00:00:00"}