{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:10:17Z","timestamp":1773655817616,"version":"3.50.1"},"reference-count":11,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.3103\/s0146411618070325","type":"journal-article","created":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T07:04:17Z","timestamp":1551683057000},"page":"871-879","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Spanning Tree of a Divisible Multiple Graph"],"prefix":"10.3103","volume":"52","author":[{"given":"A. V.","family":"Smirnov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1627","published-online":{"date-parts":[[2019,3,4]]},"reference":[{"key":"7054_CR1","doi-asserted-by":"publisher","first-page":"788","DOI":"10.18255\/1818-1015-2017-6-788-801","volume":"24","author":"A.V. Smirnov","year":"2017","unstructured":"Smirnov, A.V., The shortest path problem for a multiple graph, Model. Anal. Inf. Syst., 2017, vol. 24, no. 6, pp.\u00a0788\u2013801.","journal-title":"Model. Anal. Inf. Syst."},{"key":"7054_CR2","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C., Introduction to Algorithms, The MIT Press, McGraw-Hill Book Company, 2009, 3rd ed."},{"key":"7054_CR3","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C., Graphs and Hypergraphs, North-Holland Publishing Company, 1973."},{"key":"7054_CR4","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. and Blanning, R.W., Metagraphs in workflow support systems, Decis. Support Syst., 1999, vol. 25, no.\u00a03, pp. 199\u2013208.","journal-title":"Decis. Support Syst."},{"key":"7054_CR5","volume-title":"Metagraphs and Their Applications","author":"A. Basu","year":"2007","unstructured":"Basu, A. and Blanning, R.W., Metagraphs and Their Applications, Integrated Series in Information Systems, Springer US, 2007, vol. 15."},{"key":"7054_CR6","first-page":"60","volume":"3","author":"V.S. Rublev","year":"2011","unstructured":"Rublev, V.S. and Smirnov, A.V., Flows in multiple networks, Yarosl. Pedagog. Vestn., 2011, vol. 3, no. 2, pp. 60\u201368.","journal-title":"Yarosl. Pedagog. Vestn."},{"key":"7054_CR7","doi-asserted-by":"publisher","first-page":"527","DOI":"10.3103\/S0146411616070191","volume":"50","author":"A.V. Smirnov","year":"2016","unstructured":"Smirnov, A.V., The problem of finding the maximum multiple flow in the divisible network and its special cases, Autom. Control Comput. Sci., 2016, vol. 50, no. 7, pp. 527\u2013535.","journal-title":"Autom. Control Comput. Sci."},{"key":"7054_CR8","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R. and Fulkerson, D.R., Flows in Networks, Princeton University Press, 1962."},{"key":"7054_CR9","first-page":"72","volume":"17","author":"V.S. Roublev","year":"2010","unstructured":"Roublev, V.S. and Smirnov, A.V., The problem of integer-valued balancing of a three-dimensional matrix and algorithms of its solution, Model. Anal. Inf. Syst., 2010, vol. 17, no. 2, pp. 72\u201398.","journal-title":"Model. Anal. Inf. Syst."},{"key":"7054_CR10","doi-asserted-by":"publisher","first-page":"558","DOI":"10.3103\/S0146411617070185","volume":"51","author":"A.V. Smirnov","year":"2017","unstructured":"Smirnov, A.V., Network model for the problem of integer balancing of a four-dimensional matrix, Autom. Control Comput. Sci., 2017, vol. 51, no. 7, pp. 558\u2013566.","journal-title":"Autom. Control Comput. Sci."},{"key":"7054_CR11","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B., On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Am. Math. Soc., 1956, vol. 7, no. 1, pp. 48\u201350.","journal-title":"Proc. Am. Math. Soc."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411618070325.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411618070325","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411618070325.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T21:58:19Z","timestamp":1773611899000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411618070325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":11,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["7054"],"URL":"https:\/\/doi.org\/10.3103\/s0146411618070325","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12]]},"assertion":[{"value":"29 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}