{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:52:40Z","timestamp":1778597560398,"version":"3.51.4"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["17-07-00823 A"],"award-info":[{"award-number":["17-07-00823 A"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10878-021-00810-5","type":"journal-article","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T12:23:53Z","timestamp":1632745433000},"page":"850-869","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Spanning tree of a multiple graph"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0980-2507","authenticated-orcid":false,"given":"Alexander V.","family":"Smirnov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"issue":"3","key":"810_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0167-9236(99)00006-8","volume":"25","author":"A Basu","year":"1999","unstructured":"Basu A, Blanning RW (1999) Metagraphs in workflow support systems. Decis Support Syst 25(3):199\u2013208. https:\/\/doi.org\/10.1016\/S0167-9236(99)00006-8","journal-title":"Decis Support Syst"},{"key":"810_CR2","unstructured":"Basu A, Blanning RW (2007) Metagraphs and their applications. Integrated series in information systems, vol\u00a015. Springer US"},{"key":"810_CR3","unstructured":"Berge C (1973) Graphs and hypergraphs. North-Holland Publishing Company"},{"key":"810_CR4","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. The MIT Press, McGraw-Hill Book Company"},{"key":"810_CR5","doi-asserted-by":"crossref","unstructured":"Ford LR, Fulkerson DR (1962) Flows in networks. Princeton University Press","DOI":"10.1515\/9781400875184"},{"issue":"1","key":"810_CR6","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7(1):48\u201350. https:\/\/doi.org\/10.1090\/S0002-9939-1956-0078686-7","journal-title":"Proc Am Math Soc"},{"issue":"7","key":"810_CR7","doi-asserted-by":"publisher","first-page":"527","DOI":"10.3103\/S0146411616070191","volume":"50","author":"AV Smirnov","year":"2016","unstructured":"Smirnov AV (2016) The problem of finding the maximum multiple flow in the divisible network and its special cases. Autom Control Comput Sci 50(7):527\u2013535. https:\/\/doi.org\/10.3103\/S0146411616070191","journal-title":"Autom Control Comput Sci"},{"issue":"7","key":"810_CR8","doi-asserted-by":"publisher","first-page":"625","DOI":"10.3103\/S0146411618070234","volume":"52","author":"AV Smirnov","year":"2018","unstructured":"Smirnov AV (2018) The shortest path problem for a multiple graph. Autom Control Comput Sci 52(7):625\u2013633. https:\/\/doi.org\/10.3103\/S0146411618070234","journal-title":"Autom Control Comput Sci"},{"issue":"7","key":"810_CR9","doi-asserted-by":"publisher","first-page":"871","DOI":"10.3103\/S0146411618070325","volume":"52","author":"AV Smirnov","year":"2018","unstructured":"Smirnov AV (2018) The spanning tree of a divisible multiple graph. Autom Control Comput Sci 52(7):871\u2013879. https:\/\/doi.org\/10.3103\/S0146411618070325","journal-title":"Autom Control Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00810-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00810-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00810-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,7]],"date-time":"2022-05-07T06:22:58Z","timestamp":1651904578000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00810-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,27]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["810"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00810-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,27]]},"assertion":[{"value":"14 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}