{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T14:10:24Z","timestamp":1738332624669,"version":"3.35.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,8,15]],"date-time":"2008-08-15T00:00:00Z","timestamp":1218758400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s00224-008-9141-y","type":"journal-article","created":{"date-parts":[[2008,8,14]],"date-time":"2008-08-14T17:22:11Z","timestamp":1218734531000},"page":"59-79","source":"Crossref","is-referenced-by-count":4,"title":["A Fast Algorithm for the Path 2-Packing Problem"],"prefix":"10.1007","volume":"46","author":[{"given":"Maxim A.","family":"Babenko","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,8,15]]},"reference":[{"key":"9141_CR1","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-540-74510-5_10","volume":"4649","author":"M. Babenko","year":"2007","unstructured":"Babenko, M.: A fast algorithm for path 2-packing problem. Lect. Notes Comput. Sci. 4649, 70\u201381 (2007)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"13","key":"9141_CR2","doi-asserted-by":"crossref","first-page":"1715","DOI":"10.1016\/j.dam.2007.02.012","volume":"155","author":"M. Babenko","year":"2007","unstructured":"Babenko, M., Karzanov, A.: Free multiflows in bidirected and skew-symmetric graphs. Discrete Appl. Math. 155(13), 1715\u20131730 (2007)","journal-title":"Discrete Appl. Math."},{"key":"9141_CR3","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/978-3-540-87744-8_11","volume":"5193","author":"M. Babenko","year":"2008","unstructured":"Babenko, M., Karzanov, A.: A scaling algorithm for the maximum node-capacitated multiflow problem. Lect. Notes Comput. Sci. 5193, 124\u2013135 (2008)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"1","key":"9141_CR4","first-page":"143","volume":"13","author":"B. Cherkassky","year":"1977","unstructured":"Cherkassky, B.: A solution of a problem on multicommodity flows in a network. Ekon. Mat. Metody 13(1), 143\u2013151 (1977)","journal-title":"Ekon. Mat. Metody"},{"issue":"2","key":"9141_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s00493-008-2157-8","volume":"28","author":"M. Chudnovsky","year":"2008","unstructured":"Chudnovsky, M., Geelen, J., Cunningham, W.: An algorithm for packing non-zero A-paths in group-labelled graphs. Combinatorica 28(2), 145\u2013161 (2008)","journal-title":"Combinatorica"},{"key":"9141_CR6","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/363269.363610","volume":"12","author":"R. Dial","year":"1969","unstructured":"Dial, R.: Algorithm\u00a0360: Shortest path forest with topological ordering. Commun. ACM 12, 632\u2013633 (1969)","journal-title":"Commun. ACM"},{"key":"9141_CR7","volume-title":"Flows in Networds","author":"L. Ford","year":"1962","unstructured":"Ford, L., Fulkerson, D.: Flows in Networds. Princeton University Press, Princeton (1962)"},{"key":"9141_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0167-5060(08)70459-X","volume":"41","author":"A. Frank","year":"1989","unstructured":"Frank, A.: On connectivity properties of Eulerian digraphs. Ann. Discrete Math. 41, 179\u2013194 (1989)","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"9141_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/PL00009811","volume":"18","author":"T. Ibaraki","year":"1998","unstructured":"Ibaraki, T., Karzanov, A., Nagamochi, H.: A\u00a0fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations. Combinatorica 18(1), 61\u201383 (1998)","journal-title":"Combinatorica"},{"key":"9141_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/276698.276714","volume-title":"STOC\u00a0\u201998: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing","author":"D. Karger","year":"1998","unstructured":"Karger, D., Levine, M.: Finding maximum flows in undirected graphs seems easier than bipartite matching. In: STOC\u00a0\u201998: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp.\u00a069\u201378. ACM, New York (1998)"},{"key":"9141_CR11","first-page":"6","volume-title":"Combinatorial Methods for Flow Problems","author":"A. Karzanov","year":"1979","unstructured":"Karzanov, A.: Combinatorial methods to solve cut-dependent problems on multiflows. In: Combinatorial Methods for Flow Problems, vol.\u00a03, pp.\u00a06\u201369. Inst. for System Studies, Moscow (1979)"},{"key":"9141_CR12","first-page":"96","volume-title":"Combinatorial Methods for Flow Problems","author":"A. Karzanov","year":"1979","unstructured":"Karzanov, A.: Fast algorithms for solving two known problems on undirected multicommodity flows. In: Combinatorial Methods for Flow Problems, vol.\u00a03, pp.\u00a096\u2013103. Inst. for System Studies, Moscow (1979)"},{"key":"9141_CR13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01902503","volume":"28","author":"L. Lov\u00e1sz","year":"1976","unstructured":"Lov\u00e1sz, L.: On some connectivity properties of Eulerian graphs. Acta Math. Akad. Sci. Hung. 28, 129\u2013138 (1976)","journal-title":"Acta Math. Akad. Sci. Hung."},{"key":"9141_CR14","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","volume":"28","author":"L. Lov\u00e1sz","year":"1980","unstructured":"Lov\u00e1sz, L.: Matroid matching and some applications. J. Comb. Theory Ser.\u00a0B 28, 208\u2013236 (1980)","journal-title":"J. Comb. Theory Ser.\u00a0B"},{"key":"9141_CR15","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01226062","volume":"30","author":"W. Mader","year":"1978","unstructured":"Mader, W.: \u00dcber die maximalzahl kantendisjunkter a-wege. Arch. Math. (Basel) 30, 325\u2013336 (1978)","journal-title":"Arch. Math. (Basel)"},{"key":"9141_CR16","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1007\/BF01226465","volume":"31","author":"W. Mader","year":"1978","unstructured":"Mader, W.: \u00dcber die maximalzahl kantendisjunkter H-wege. Arch. Math. (Basel) 31, 382\u2013402 (1978)","journal-title":"Arch. Math. (Basel)"},{"key":"9141_CR17","unstructured":"Pap, G.: A constructive approach to matching and its generalizations. Ph.D.\u00a0Thesis, E\u00f6tv\u00f6s University, Department of Operations Research (2006)"},{"issue":"2","key":"9141_CR18","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s00493-007-0056-z","volume":"27","author":"G. Pap","year":"2007","unstructured":"Pap, G.: Packing non-returning A-paths. Combinatorica 27(2), 247\u2013251 (2007)","journal-title":"Combinatorica"},{"issue":"8","key":"9141_CR19","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1016\/j.disc.2007.07.073","volume":"308","author":"G. Pap","year":"2008","unstructured":"Pap, G.: Packing non-returning A-paths algorithmically. Discrete Math. 308(8), 1472\u20131488 (2008)","journal-title":"Discrete Math."},{"key":"9141_CR20","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1006\/jctb.2000.2029","volume":"82","author":"A. Schrijver","year":"2001","unstructured":"Schrijver, A.: A short proof of Mader\u2019s S-paths theorem. J. Comb. Theory Ser.\u00a0B 82, 319\u2013321 (2001)","journal-title":"J. Comb. Theory Ser.\u00a0B"},{"key":"9141_CR21","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, New York (2003)"},{"key":"9141_CR22","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, New York (2001)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-008-9141-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-008-9141-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-008-9141-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T13:50:15Z","timestamp":1738331415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-008-9141-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,15]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["9141"],"URL":"https:\/\/doi.org\/10.1007\/s00224-008-9141-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2008,8,15]]}}}