{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:11:36Z","timestamp":1773655896331,"version":"3.50.1"},"reference-count":20,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"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":[[2024,12]]},"DOI":"10.3103\/s0146411624700342","type":"journal-article","created":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T14:48:38Z","timestamp":1739371718000},"page":"889-903","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Algorithms for the Eulerian Cycle and Eulerian Trail Problems for a Multiple Graph"],"prefix":"10.3103","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0980-2507","authenticated-orcid":false,"given":"A. V.","family":"Smirnov","sequence":"first","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2025,2,12]]},"reference":[{"key":"7755_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":"7755_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":"7755_CR3","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C., Graphs and Hypergraphs, North-Holland, 1973."},{"key":"7755_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":"7755_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":"7755_CR6","unstructured":"Rublev, V.S. and Smirnov, A.V., Flows in multiple networks, Yaroslavskii Pedagogicheskii Vestn., 2011, vol. 3, no.\u00a02, pp. 60\u201368."},{"key":"7755_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":"7755_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":"7755_CR9","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. Sistem, 2010, vol. 17, no. 2, pp. 72\u201398. https:\/\/www.mathnet.ru\/eng\/mais5."},{"key":"7755_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":"7755_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":"7755_CR12","doi-asserted-by":"crossref","unstructured":"Smirnov, A.V., The optimized algorithm of finding the shortest path in a multiple graph, Autom. Control Comput. Sci., 2024, vol. 58, no. 7.","DOI":"10.3103\/S0146411624700226"},{"key":"7755_CR13","doi-asserted-by":"publisher","first-page":"788","DOI":"10.3103\/s0146411622070173","volume":"56","author":"A.V. Smirnov","year":"2022","unstructured":"Smirnov, A.V., NP-completeness of the minimum spanning tree problem of a multiple graph of multiplicity k \u2265 3, Autom. Control Comput. Sci., 2022, vol. 56, no. 7, pp. 788\u2013799. https:\/\/doi.org\/10.3103\/s0146411622070173","journal-title":"Autom. Control Comput. Sci."},{"key":"7755_CR14","first-page":"128","volume":"8","author":"L. Euler","year":"1741","unstructured":"Euler, L., Solutio problematis ad geometriam situs pertinentis, Comment. Acad. Petropolitanae, 1741, vol. 8, pp.\u00a0128\u2013140.","journal-title":"Comment. Acad. Petropolitanae"},{"key":"7755_CR15","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/bf01442866","volume":"6","author":"C. Hierholzer","year":"1873","unstructured":"Hierholzer, C. and Wiener, Ch., Ueber die M\u00f6glichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren, Math. Ann., 1873, vol. 6, no. 1, pp. 30\u201332. https:\/\/doi.org\/10.1007\/bf01442866","journal-title":"Math. Ann."},{"key":"7755_CR16","volume-title":"Deux probl\u00e8mes de g\u00e9om\u00e9trie de situation","author":"M. Fleury","year":"1883","unstructured":"Fleury, M., Deux probl\u00e8mes de g\u00e9om\u00e9trie de situation, J. Math. \u00c9l\u00e9mentaires, 1883, vol. 2, pp. 257\u2013261."},{"key":"7755_CR17","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F., Graph Theory, Addison-Wesley, 1969."},{"key":"7755_CR18","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/jgt.3190190202","volume":"19","author":"M.-C. Cai","year":"1995","unstructured":"Cai, M.-C. and Fleischner, H., An Eulerian trail traversing specialized edges in given order, J. Graph Theory, 1995, vol. 19, no. 2, pp. 137\u2013144. https:\/\/doi.org\/10.1002\/jgt.3190190202","journal-title":"J. Graph Theory"},{"key":"7755_CR19","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218x(94)90010-8","volume":"55","author":"M.-C. Cai","year":"1994","unstructured":"Cai, M.-C., An algorithm for an Eulerian trail traversing specified edges in given order, Discrete Appl. Math., 1994, vol. 55, no. 3, pp. 233\u2013239. https:\/\/doi.org\/10.1016\/0166-218x(94)90010-8","journal-title":"Discrete Appl. Math."},{"key":"7755_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0167-5060(08)70852-5","volume":"8","author":"J. Abrham","year":"1980","unstructured":"Abrham, J. and Kotzig, A., Transformations of Euler tours, Ann. Discrete Math., 1980, vol. 8, pp. 65\u201369. https:\/\/doi.org\/10.1016\/S0167-5060(08)70852-5","journal-title":"Ann. Discrete Math."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411624700342.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411624700342","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411624700342.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:04:58Z","timestamp":1773612298000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411624700342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["7755"],"URL":"https:\/\/doi.org\/10.3103\/s0146411624700342","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"13 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The author of this work declares that he has no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}