{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:15:31Z","timestamp":1740287731149,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_28","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"306-317","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs"],"prefix":"10.1007","author":[{"given":"Xujin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenan","family":"Zang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","volume-title":"Network Flows \u2013 Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows \u2013 Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, New Jersey (1993)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1137\/0218065","volume":"18","author":"R.K. Ahuja","year":"1989","unstructured":"Ahuja, R.K., Orlin, J.B., Tarjan, R.E.: Improved time bounds for the maximum flow problem. SIAM J. Comput.\u00a018, 939\u2013954 (1989)","journal-title":"SIAM J. Comput."},{"key":"28_CR3","volume-title":"Principle of Compiler Design","author":"A.V. Aho","year":"1977","unstructured":"Aho, A.V., Ullman, J.D.: Principle of Compiler Design. Addison-Wesley, Reading (1977)"},{"key":"28_CR4","unstructured":"Cai, M.C., Deng, X.T., Zang, W.: A TDI system and its application to approximation algorithms. In: Proc. 39 th IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, pp. 227\u2013233 (1998)"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1137\/S0097539798338163","volume":"30","author":"M.C. Cai","year":"2001","unstructured":"Cai, M.C., Deng, X.T., Zang, W.: An approximation algorithm for feedback vertex sets in tournaments. SIAM J. Comput.\u00a030, 1993\u20132007 (2001)","journal-title":"SIAM J. Comput."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1287\/moor.27.2.361.328","volume":"27","author":"M.C. Cai","year":"2002","unstructured":"Cai, M.C., Deng, X.T., Zang, W.: A min-max theorem on feedback vertex sets. Math. Oper. Res.\u00a027, 361\u2013371 (2002)","journal-title":"Math. Oper. Res."},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0196-6774(03)00052-X","volume":"48","author":"A. Caprara","year":"2003","unstructured":"Caprara, A., Panconesi, A., Rizzi, R.: Packing cycles in undirected graphs. J. Algorithms\u00a048, 239\u2013256 (2003)","journal-title":"J. Algorithms"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1006\/jctb.2002.2134","volume":"86","author":"G. Ding","year":"2002","unstructured":"Ding, G., Zang, W.: Packing cycles in graphs. J. Combin. Theory Ser. B\u00a086, 381\u2013407 (2002)","journal-title":"J. Combin. Theory Ser. B"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/S0095-8956(02)00007-2","volume":"87","author":"G. Ding","year":"2003","unstructured":"Ding, G., Xu, Z., Zang, W.: Packing cycles in graphs, II. J. Combin. Theory Ser. B\u00a087, 244\u2013253 (2003)","journal-title":"J. Combin. Theory Ser. B"},{"key":"28_CR10","first-page":"1277","volume":"11","author":"E.A. Dinits","year":"1970","unstructured":"Dinits, E.A.: Algorithms for solution of a problem of maximum flow in a network with power estimation. Soviet Mathematics Doklady\u00a011, 1277\u20131280 (1970)","journal-title":"Soviet Mathematics Doklady"},{"key":"28_CR11","volume-title":"Flows in Networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton Univ. Press, Princeton (1962)"},{"key":"28_CR12","first-page":"157","volume":"260","author":"A. Frank","year":"1976","unstructured":"Frank, A., Gyarfas, A.: Directed graphs and computer programs. Problemes Combinatoires et Theorie des Graphes, Colloque Internationaux C.N.R.S.\u00a0260, 157\u2013158 (1976)","journal-title":"Problemes Combinatoires et Theorie des Graphes, Colloque Internationaux C.N.R.S."},{"key":"28_CR13","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, New York (1979)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Goldberg, A., Tarjan, R.E.: A new approach to the maximum flow problem. In: Proc. 18th Annu. ACM Symp. on Theory of Computing, pp. 136\u2013146 (1985)","DOI":"10.1145\/12130.12144"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Harel, D.: A linear algorithm for finding dominators in flow graphs and related problems. In: Proc. 17th Annual ACM Symp. on Theory of Computing, pp. 185\u2013194 (1984)","DOI":"10.1145\/22145.22166"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0201014","volume":"1","author":"M.S. Hecht","year":"1972","unstructured":"Hecht, M.S., Ullman, J.D.: Flow graph reducibility. SIAM J. Comput.\u00a01, 188\u2013202 (1972)","journal-title":"SIAM J. Comput."},{"key":"28_CR17","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/321832.321835","volume":"21","author":"M.S. Hecht","year":"1974","unstructured":"Hecht, M.S., Ullman, J.D.: Characterizations of reducible graphs. J. Assoc. Comput. Mach.\u00a021, 367\u2013375 (1974)","journal-title":"J. Assoc. Comput. Mach."},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0196-6774(88)90022-3","volume":"9","author":"V. Ramachandran","year":"1988","unstructured":"Ramachandran, V.: Finding a minimum feedback arc set in reducible flow graphs. J. Algorithms\u00a09, 299\u2013313 (1988)","journal-title":"J. Algorithms"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/0403048","volume":"3","author":"V. Ramachandran","year":"1990","unstructured":"Ramachandran, V.: A minimax arc theorem for reducible flow graphs. SIAM J. Discrete Math.\u00a03, 554\u2013560 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1996.0820","volume":"23","author":"V. Ramachandran","year":"1997","unstructured":"Ramachandran, V.: Parallel algorithms for reducible flow graphs. J. Algorithms\u00a023, 1\u201331 (1997)","journal-title":"J. Algorithms"},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1137\/0208051","volume":"8","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: A linear time algorithm for finding minimum cutsets in reducible graphs. SIAM J. Comput.\u00a08, 645\u2013655 (1979)","journal-title":"SIAM J. Comput."},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithm. SIAM J. Comput.\u00a01, 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0022-0000(74)80049-8","volume":"9","author":"R.E. Tarjan","year":"1974","unstructured":"Tarjan, R.E.: Testing flow reducibility. J. Comput. System Sci.\u00a09, 355\u2013365 (1974)","journal-title":"J. Comput. System Sci."},{"key":"28_CR24","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structure and Network Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Data Structure and Network Algorithms. SIAM, Philadelphia (1983)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:52:17Z","timestamp":1740261137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}