{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:05:20Z","timestamp":1773615920489,"version":"3.50.1"},"reference-count":22,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"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":[[2025,12]]},"DOI":"10.3103\/s0146411625700348","type":"journal-article","created":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T19:15:00Z","timestamp":1771528500000},"page":"1015-1031","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Some Polynomial Subclasses of the Eulerian Walk Problem for a Multiple Graph"],"prefix":"10.3103","volume":"59","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":[[2026,2,19]]},"reference":[{"key":"7894_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":"7894_CR2","first-page":"60","volume":"3","author":"V.S. Rublev","year":"2011","unstructured":"Rublev, V.S. and Smirnov, A.V., Flows in multiple networks, Yaroslavskii Pedagogicheskii Vestnik, 2011, vol. 3, no. 2, pp. 60\u201368.","journal-title":"Yaroslavskii Pedagogicheskii Vestnik"},{"key":"7894_CR3","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":"7894_CR4","doi-asserted-by":"publisher","unstructured":"Ford, L.R. and Fulkerson, D.R., Flows in Networks, Princeton Landmarks in Mathematics and Physics, vol. 56, Princeton, NJ: Princeton University Press, 1962. https:\/\/doi.org\/10.1515\/9781400875184","DOI":"10.1515\/9781400875184"},{"key":"7894_CR5","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, Modeling and Analysis of Information Systems, 2010, vol. 17, no. 2, pp. 72\u201398.","journal-title":"Modeling and Analysis of Information Systems"},{"key":"7894_CR6","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":"7894_CR7","doi-asserted-by":"publisher","first-page":"889","DOI":"10.3103\/s0146411624700342","volume":"58","author":"A.V. Smirnov","year":"2024","unstructured":"Smirnov, A.V., The algorithms for the Eulerian cycle and Eulerian trail problems for a multiple graph, Autom. Control Comput. Sci., 2024, vol. 58, no. 7, pp. 889\u2013903. https:\/\/doi.org\/10.3103\/s0146411624700342","journal-title":"Autom. Control Comput. Sci."},{"key":"7894_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/bf01442866","volume":"6","author":"C. Hierholzer","year":"1873","unstructured":"Hierholzer, C. and Wiener, Chr., 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":"7894_CR9","doi-asserted-by":"publisher","unstructured":"Berge, C., Graphs and Hypergraphs, North-Holland Mathematical Library, vol. 6, Amsterdam: North-Holland, 1973. https:\/\/doi.org\/10.1016\/S0924-6509(09)70326-5","DOI":"10.1016\/S0924-6509(09)70326-5"},{"key":"7894_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.37236\/416","volume":"17","author":"Z. Lonc","year":"2010","unstructured":"Lonc, Z. and Naroski, P., On tours that contain all edges of a hypergraph, Electron. J. Combinatorics, 2010, vol.\u00a017, no. 1, p. 144. https:\/\/doi.org\/10.37236\/416","journal-title":"Electron. J. Combinatorics"},{"key":"7894_CR11","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s00453-022-01021-y","volume":"85","author":"A. Marino","year":"2023","unstructured":"Marino, A. and Silva, A., Eulerian walks in temporal graphs, Algorithmica, 2023, vol. 85, no. 3, pp. 805\u2013830. https:\/\/doi.org\/10.1007\/s00453-022-01021-y","journal-title":"Algorithmica"},{"key":"7894_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0166-218x(87)90045-x","volume":"18","author":"S.W. Bent","year":"1987","unstructured":"Bent, S.W. and Manber, U., On non-intersecting Eulerian circuits, Discrete Appl. Math., 1987, vol. 18, no. 1, pp.\u00a087\u201394. https:\/\/doi.org\/10.1016\/0166-218x(87)90045-x","journal-title":"Discrete Appl. Math."},{"key":"7894_CR13","doi-asserted-by":"publisher","unstructured":"Jimbo, Sh., The NP-completeness of Eulerian recurrent length for 4-regular Eulerian graphs, 2014 4th International Conference on Artificial Intelligence with Applications in Engineering and Technology, Kota Kinabalu, Malaysia, 2014, IEEE, 2014, pp. 155\u2013159. https:\/\/doi.org\/10.1109\/icaiet.2014.34","DOI":"10.1109\/icaiet.2014.34"},{"key":"7894_CR14","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.3103\/s0146411624700470","volume":"58","author":"A.V. Smirnov","year":"2024","unstructured":"Smirnov, A.V., NP-completeness of the Eulerian walk problem for a multiple graph, Autom. Control Comput. Sci., 2024, vol. 58, no. 7, pp. 1082\u20131091. https:\/\/doi.org\/10.3103\/s0146411624700470","journal-title":"Autom. Control Comput. Sci."},{"key":"7894_CR15","doi-asserted-by":"publisher","unstructured":"Abrham, J. and Kotzig, A., Transformations of Euler tours, Combinatorics 79, Part I, Deza, M. and Rosenberg, I.G., Eds., Annals of Discrete Mathematics, vol. 8, Elsevier, 1980, pp. 65\u201369. https:\/\/doi.org\/10.1016\/s0167-5060(08)70852-5","DOI":"10.1016\/s0167-5060(08)70852-5"},{"key":"7894_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"R.M. Karp","year":"1975","unstructured":"Karp, R.M., On the computational complexity of combinatorial problems, Networks, 1975, vol. 5, no. 1, pp. 45\u201368. https:\/\/doi.org\/10.1002\/net.1975.5.1.45","journal-title":"Networks"},{"key":"7894_CR17","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 Math., 1959, vol. 1, no. 1, pp.\u00a0269\u2013271. https:\/\/doi.org\/10.1007\/bf01386390","journal-title":"Numerische Math."},{"key":"7894_CR18","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F., Graph Theory, Reading, MA: Addison-Wesley, 1969."},{"key":"7894_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/bf01202792","volume":"13","author":"M. Middendorf","year":"1993","unstructured":"Middendorf, M. and Pfeiffer, F., On the complexity of the disjoint paths problem, Combinatorica, 1993, vol. 13, no. 1, pp. 97\u2013107. https:\/\/doi.org\/10.1007\/bf01202792","journal-title":"Combinatorica"},{"key":"7894_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N. and Seymour, P.D., Graph minors. XIII. The disjoint paths problem, J. Comb. Theory, Ser. B, 1995, vol. 63, no. 1, pp. 65\u2013110. https:\/\/doi.org\/10.1006\/jctb.1995.1006","journal-title":"J. Comb. Theory, Ser. B"},{"key":"7894_CR21","doi-asserted-by":"publisher","unstructured":"Alon, N. and Capalbo, M., Finding disjoint paths in expanders deterministically and online, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201907), Providence, RI, 2007, IEEE, 2007, pp. 518\u2013524. https:\/\/doi.org\/10.1109\/focs.2007.19","DOI":"10.1109\/focs.2007.19"},{"key":"7894_CR22","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/bf01294465","volume":"15","author":"D. Wagner","year":"1995","unstructured":"Wagner, D. and Weihe, K., A linear-time algorithm for edge-disjoint paths in planar graphs, Combinatorica, 1995, vol. 15, no. 1, pp. 135\u2013150. https:\/\/doi.org\/10.1007\/bf01294465","journal-title":"Combinatorica"}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411625700348.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411625700348","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411625700348.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:07:11Z","timestamp":1773612431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411625700348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":22,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["7894"],"URL":"https:\/\/doi.org\/10.3103\/s0146411625700348","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"3 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2026","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"}}]}}