{"id":"https://openalex.org/W7130570069","doi":"https://doi.org/10.3103/s0146411625700348","title":"Some Polynomial Subclasses of the Eulerian Walk Problem for a Multiple Graph","display_name":"Some Polynomial Subclasses of the Eulerian Walk Problem for a Multiple Graph","publication_year":2025,"publication_date":"2025-12-01","ids":{"openalex":"https://openalex.org/W7130570069","doi":"https://doi.org/10.3103/s0146411625700348"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411625700348","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411625700348","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/A5126445578","display_name":"A. V. Smirnov","orcid":null},"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"],"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/A5126445578"],"corresponding_institution_ids":["https://openalex.org/I198371094"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.79713631,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"59","issue":"7","first_page":"1015","last_page":"1031"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.3066999912261963,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.3066999912261963,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.13570000231266022,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.11180000007152557,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.7095000147819519},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5946999788284302},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5425000190734863},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42419999837875366},{"id":"https://openalex.org/keywords/multiple-edges","display_name":"Multiple edges","score":0.38179999589920044},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.34439998865127563},{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.34299999475479126},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3370000123977661}],"concepts":[{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.7095000147819519},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6776999831199646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6556000113487244},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5946999788284302},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5425000190734863},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5407000184059143},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42419999837875366},{"id":"https://openalex.org/C103257674","wikidata":"https://www.wikidata.org/wiki/Q6934937","display_name":"Multiple edges","level":3,"score":0.38179999589920044},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34439998865127563},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.34299999475479126},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.33390000462532043},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.3264999985694885},{"id":"https://openalex.org/C171528893","wikidata":"https://www.wikidata.org/wiki/Q5121450","display_name":"Circle graph","level":5,"score":0.320499986410141},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.30720001459121704},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.2980000078678131},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.2897000014781952},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C53052385","wikidata":"https://www.wikidata.org/wiki/Q17104046","display_name":"Mixed graph","level":5,"score":0.27320000529289246},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C8764922","wikidata":"https://www.wikidata.org/wiki/Q17104195","display_name":"Topological graph","level":3,"score":0.26600000262260437},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.2540999948978424},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3103/s0146411625700348","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411625700348","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":20,"referenced_works":["https://openalex.org/W11818456","https://openalex.org/W100926944","https://openalex.org/W1586183010","https://openalex.org/W1973343935","https://openalex.org/W2005079828","https://openalex.org/W2041884875","https://openalex.org/W2048459753","https://openalex.org/W2066881276","https://openalex.org/W2124580127","https://openalex.org/W2169528473","https://openalex.org/W2314502764","https://openalex.org/W2540385142","https://openalex.org/W2572716357","https://openalex.org/W2922839089","https://openalex.org/W4213214460","https://openalex.org/W4244424643","https://openalex.org/W4253731756","https://openalex.org/W4293017958","https://openalex.org/W4407402586","https://openalex.org/W4407423335"],"related_works":[],"abstract_inverted_index":{"In":[0,161,186],"this":[1,206],"paper,":[2],"we":[3,165,190],"study":[4,110],"undirected":[5],"multiple":[6,24,65,74,125,137,152,214],"graphs":[7],"of":[8,19,30,38,83,87,97,106,113,147,150,179,205,212,224],"any":[9],"natural":[10],"multiplicity":[11],"$$k":[12],">":[13],"1$$":[14],".":[15],"There":[16],"are":[17,176,231],"edges":[18,53,75,86,172,184,227],"three":[20],"types:":[21],"ordinary":[22,134,171,183,207,226],"edges,":[23,25,41],"and":[26,76,156,216],"multi-edges.":[27],"Each":[28],"edge":[29],"the":[31,80,94,103,111,115,121,129,145,151,158,162,170,177,187,195,210,213,225],"last":[32],"two":[33,148],"types":[34],"is":[35,61,93,141,219],"a":[36,59,64,91,124,167,192,199],"union":[37],"$$k$$":[39,84,222],"linked":[40,52,85],"which":[42,127,175,230],"connect":[43],"2":[44],"or":[45,120],"$$(k":[46],"+":[47],"1)$$":[48],"vertices,":[49],"correspondingly.":[50],"The":[51,136,203],"should":[54],"be":[55,69,79,102],"used":[56],"simultaneously.":[57],"If":[58,90],"vertex":[60,92],"incident":[62,71,232],"to":[63,72,233],"edge,":[66],"it":[67,77,100],"can":[68,78],"also":[70],"other":[73],"common":[81,95,104],"end":[82,96,105],"some":[88,98,234],"multi-edge.":[89,108,235],"multi-edge,":[99],"cannot":[101],"another":[107],"We":[109,143],"problem":[112,131,140,155],"finding":[114],"Eulerian":[116,138,153],"walk":[117,139,154],"(the":[118],"cycle":[119],"trail)":[122],"in":[123,198],"graph,":[126,215],"generalizes":[128],"classical":[130],"for":[132],"an":[133],"graph.":[135],"NP-hard.":[142],"prove":[144],"polynomiality":[146],"subclasses":[149],"elaborate":[157],"polynomial":[159],"algorithms.":[160],"first":[163],"subclass,":[164,189],"set":[166,191],"constraint":[168,193],"on":[169,194],"reachability":[173,228],"sets,":[174,229],"subsets":[178],"vertices":[180],"joined":[181],"by":[182,221],"only.":[185],"second":[188],"quasi-vertices":[196],"degrees":[197],"graph":[200,208],"with":[201],"quasi-vertices.":[202],"structure":[204,211],"reflects":[209],"each":[217],"quasi-vertex":[218],"determined":[220],"indices":[223]},"counts_by_year":[],"updated_date":"2026-02-20T17:44:18.066148","created_date":"2026-02-20T00:00:00"}