{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:10:43Z","timestamp":1773655843617,"version":"3.50.1"},"reference-count":12,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"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":[[2023,12]]},"DOI":"10.3103\/s0146411623070143","type":"journal-article","created":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T14:02:19Z","timestamp":1709042539000},"page":"841-853","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph"],"prefix":"10.3103","volume":"57","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0980-2507","authenticated-orcid":false,"given":"A. V.","family":"Smirnov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1627","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"7641_CR1","doi-asserted-by":"publisher","first-page":"625","DOI":"10.3103\/s0146411618070234","volume":"52","author":"A.V. Smirnov","year":"2018","unstructured":"Smirnov, A.V., The shortest path problem for a multiple graph, Autom. Control Comput. Sci., 2018, vol. 52, no.\u00a07, pp. 625\u2013633. https:\/\/doi.org\/10.3103\/s0146411618070234","journal-title":"Autom. Control Comput. Sci."},{"key":"7641_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, McGraw-Hill, 2009, 3rd ed."},{"key":"7641_CR3","unstructured":"Graphs and Hypergraphs, Berge, C., Ed., North-Holland Mathematical Library, vol. 6, North-Holland, 1973."},{"key":"7641_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, Decision Support Syst., 1999, vol. 25, no. 3, pp. 199\u2013208. https:\/\/doi.org\/10.1016\/s0167-9236(99)00006-8","journal-title":"Decision Support Syst."},{"key":"7641_CR5","doi-asserted-by":"publisher","unstructured":"Basu, A. and Blanning, R.W., Metagraphs and Their Applications, Integrated Series in Information Systems, vol.\u00a015, New York: Springer, 2007. https:\/\/doi.org\/10.1007\/978-0-387-37234-1","DOI":"10.1007\/978-0-387-37234-1"},{"key":"7641_CR6","first-page":"60","volume":"3","author":"V.S. Rublev","year":"2011","unstructured":"Rublev, V.S. and Smirnov, A.V., Flows in multiple networks, Yaroslavsky Pedagogichesky Vestn., 2011, vol. 3, no.\u00a02, pp. 60\u201368.","journal-title":"Yaroslavsky Pedagogichesky Vestn."},{"key":"7641_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. https:\/\/doi.org\/10.3103\/s0146411616070191","journal-title":"Autom. Control Comput. Sci."},{"key":"7641_CR8","volume-title":"Flows in networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R. and Fulkerson, D.R., Flows in networks, Princeton Univ. Press, 1962."},{"key":"7641_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. Sist., 2010, vol. 17, no. 2, pp. 72\u201398.","journal-title":"Model. Anal. Inf. Sist."},{"key":"7641_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. https:\/\/doi.org\/10.3103\/s0146411617070185","journal-title":"Autom. Control Comput. Sci."},{"key":"7641_CR11","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/s10878-021-00810-5","volume":"43","author":"A.V. Smirnov","year":"2022","unstructured":"Smirnov, A.V., Spanning tree of a multiple graph, J. Comb. Optim., 2022, vol. 43, no. 4, pp. 850\u2013869. https:\/\/doi.org\/10.1007\/s10878-021-00810-5","journal-title":"J. Comb. Optim."},{"key":"7641_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/bf01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W., A note on two problems in connexion with graphs, Numerische Mathematik, 1959, vol. 1, no. 1, pp. 269\u2013271. https:\/\/doi.org\/10.1007\/bf01386390","journal-title":"Numerische Mathematik"}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411623070143.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411623070143","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411623070143.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:01:53Z","timestamp":1773612113000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411623070143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":12,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["7641"],"URL":"https:\/\/doi.org\/10.3103\/s0146411623070143","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12]]},"assertion":[{"value":"23 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors of this work declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}