{"id":"https://openalex.org/W2891758599","doi":"https://doi.org/10.3103/s0146411618070325","title":"The Spanning Tree of a Divisible Multiple Graph","display_name":"The Spanning Tree of a Divisible Multiple Graph","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2891758599","doi":"https://doi.org/10.3103/s0146411618070325","mag":"2891758599"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411618070325","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411618070325","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":null,"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.3433,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69061634,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"52","issue":"7","first_page":"871","last_page":"879"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9983000159263611,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9983000159263611,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11106","display_name":"Data Management and Algorithms","score":0.9902999997138977,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8972078561782837},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6439135670661926},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5356478691101074},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4543839693069458},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4349100887775421},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.19917288422584534},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.18771988153457642},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15988010168075562},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.13813909888267517},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11533540487289429}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8972078561782837},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6439135670661926},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5356478691101074},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4543839693069458},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4349100887775421},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.19917288422584534},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.18771988153457642},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15988010168075562},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.13813909888267517},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11533540487289429}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3103/s0146411618070325","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411618070325","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":13,"referenced_works":["https://openalex.org/W1530753374","https://openalex.org/W1964119857","https://openalex.org/W1965680834","https://openalex.org/W2117115743","https://openalex.org/W2540385142","https://openalex.org/W2572716357","https://openalex.org/W2777766996","https://openalex.org/W2922839089","https://openalex.org/W3124905242","https://openalex.org/W3145128584","https://openalex.org/W4244424643","https://openalex.org/W4246219036","https://openalex.org/W6600510208"],"related_works":["https://openalex.org/W4317655900","https://openalex.org/W2391817034","https://openalex.org/W2801014462","https://openalex.org/W2900673039","https://openalex.org/W2320647101","https://openalex.org/W2322566471","https://openalex.org/W3041408219","https://openalex.org/W4225104649","https://openalex.org/W2188856175","https://openalex.org/W3196716875"],"abstract_inverted_index":{"In":[0,187,274],"this":[1],"paper,":[2],"we":[3,277],"study":[4],"undirected":[5],"multiple":[6,24,65,74,120,160,182,222,255],"graphs":[7],"of":[8,19,30,38,88,98,107,118,125,158,168,178,192,198,211,220,228,230],"any":[9,108,250],"natural":[10],"multiplicity":[11],"$$k":[12,46],">":[13],"1$$":[14,48],".":[15],"There":[16],"are":[17,138,171,224],"edges":[18,25,53,87,143,179,199],"three":[20],"types:":[21],"ordinary":[22,154,174],"edges,":[23,41,75],"and":[26,76,144,164,195,206,215,264],"multi-edges.":[27],"Each":[28,150],"edge":[29],"the":[31,80,95,104,116,132,141,165,176,188,190,193,201,209,212,216,231,254,259,265,275,283],"last":[32],"two":[33],"types":[34],"is":[35,61,94,113,127,152,162,184,204,234,240,257],"a":[36,59,64,89,92,128,159,181,221,244,279,290],"union":[37],"$$k$$":[39,85,135],"linked":[40,52,86,142],"which":[42,137,145],"connect":[43],"2":[44],"or":[45],"+":[47],"vertices,":[49],"correspondingly.":[50],"The":[51,122,156,226],"should":[54],"be":[55,69,79,103,272],"used":[56],"simultaneously.":[57],"If":[58,91,253],"vertex":[60,83,93],"incident":[62,71],"to":[63,72,84,115,130],"edge,":[66],"it":[67,77,101],"can":[68,78,271],"also":[70,241],"other":[73,109],"common":[81,96,105,148],"ending":[82],"multi-edge.":[90,110],"end":[97,106],"some":[99],"multi-edge,":[100],"cannot":[102],"Special":[111],"attention":[112],"paid":[114],"class":[117],"divisible":[119,202,237,251,291],"graphs.":[121,238],"main":[123],"peculiarity":[124],"them":[126],"possibility":[129],"divide":[131],"graph":[133,223,256],"into":[134],"parts,":[136],"adjusted":[139],"on":[140],"have":[146],"no":[147],"edges.":[149],"part":[151],"an":[153],"graph.":[155,252,292],"definition":[157],"tree":[161,183,203,214,219,233,247,262,269,287],"stated":[163,205],"basic":[166],"properties":[167],"such":[169],"trees":[170],"studied.":[172],"Unlike":[173],"trees,":[175],"number":[177,197],"in":[180,200,249],"not":[185],"fixed.":[186],"article,":[189,276],"estimation":[191],"minimum":[194,260,266,284],"maximum":[196],"proved.":[207],"Next,":[208],"definitions":[210],"spanning":[213,218,232,246,261,268,286],"complete":[217,245,267,285],"given.":[225],"criterion":[227],"completeness":[229],"proved":[235,242],"for":[236,282,289],"It":[239],"that":[243],"exists":[248],"weighted,":[258],"problem":[263,270,288],"set.":[273],"suggest":[278],"heuristic":[280],"algorithm":[281]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}