{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:24Z","timestamp":1725516804585},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_43","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"434-443","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithms for the k Smallest Cuts Enumeration"],"prefix":"10.1007","author":[{"given":"Li-Pu","family":"Yeh","sequence":"first","affiliation":[]},{"given":"Biing-Feng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0167-6377(97)00043-6","volume":"21","author":"M. Burlet","year":"1997","unstructured":"Burlet, M., Goldschmidt, O.: A New and Improved Algorithm for the 3-Cut Problem. Operations Research Letters\u00a021, 225\u2013227 (1997)","journal-title":"Operations Research Letters"},{"key":"43_CR3","unstructured":"Chekuri, C.S., Goldberg, A.V., Karger, D.R., Levine, M.S., Stein, C.: Experimental Study of Minimum Cut Algorithms. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 324\u2013333 (1997)"},{"key":"43_CR4","unstructured":"Dinits, E.A., Karzanov, A.V., Lomonosov, M.V.: On the Structure of a Family of Minimal Weighted Cuts in a Graph. In: Fridman, A.A. (ed.) Studies in Discrete Optimization, Nauka, Moscow, pp. 290\u2013306 (1976)"},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jagm.1999.1039","volume":"33","author":"L. Fleischer","year":"1999","unstructured":"Fleischer, L.: Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. Journal of Algorithms\u00a033, 51\u201372 (1999)","journal-title":"Journal of Algorithms"},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A New Approach to the Maximum Flow Problem. Journal of the ACM\u00a035, 921\u2013940 (1988)","journal-title":"Journal of the ACM"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/moor.19.1.24","volume":"19","author":"O. Goldschmidt","year":"1994","unstructured":"Goldschmidt, O., Hochbaum, D.S.: Polynomial Algorithm for the k-Cut Problem for Fixed k. Mathematics of Operation Research\u00a019, 24\u201337 (1994)","journal-title":"Mathematics of Operation Research"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal Network Flows. Journal of the Society for Industrial and Applied Mathematics\u00a09, 551\u2013570 (1961)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1006\/jagm.1994.1043","volume":"17","author":"J. Hao","year":"1994","unstructured":"Hao, J., Orlin, J.B.: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph. Journal of Algorithms\u00a017, 424\u2013446 (1994)","journal-title":"Journal of Algorithms"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s00453-001-0070-2","volume":"32","author":"Y. Kamidoi","year":"2002","unstructured":"Kamidoi, Y., Wakabayashi, S., Yoshida, N.: A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem. Algorithmica\u00a032, 262\u2013276 (2002)","journal-title":"Algorithmica"},{"key":"43_CR11","first-page":"1315","volume":"36","author":"Y. Kamidoi","year":"2006","unstructured":"Kamidoi, Y., Yoshida, N., Nagamochi, H.: A Deterministic Algorithm for Finding all Minimum k-Way Cuts. SIAM Journal on Computing\u00a036, 1315\u20131327 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Kapoor, S.: On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees. In: Proceedings of the 5th Integer Programming and Combinatorial Optimization Conference, pp. 132\u2013146 (1996)","DOI":"10.1007\/3-540-61310-2_11"},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"D.R. Karger","year":"1996","unstructured":"Karger, D.R., Stein, C.: A New Approach to the Minimum Cut Problem. Journal of the ACM\u00a043, 601\u2013640 (1996)","journal-title":"Journal of the ACM"},{"key":"43_CR14","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1137\/S0097539796298340","volume":"29","author":"D.R. Karger","year":"1999","unstructured":"Karger, D.R.: A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem. SIAM Journal on Computing\u00a029, 492\u2013514 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"43_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/331605.331608","volume":"47","author":"D.R. Karger","year":"2000","unstructured":"Karger, D.R.: Minimum Cuts in Near-Linear Time. Journal of the ACM\u00a047, 46\u201376 (2000)","journal-title":"Journal of the ACM"},{"key":"43_CR16","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BF01074775","volume":"22","author":"A.V. Karzanov","year":"1986","unstructured":"Karzanov, A.V., Timofeev, E.A.: Efficient algorithms for Finding All Minimal Edge Cuts of a Nonoriented Graph. Cybernetics\u00a022, 156\u2013162 (1986)","journal-title":"Cybernetics"},{"key":"43_CR17","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1006\/jagm.1994.1044","volume":"17","author":"V. King","year":"1994","unstructured":"King, V., Rao, S., Tarjan, R.E.: A Faster Deterministic Maximum Flow Algorithm. Journal of Algorithms\u00a017, 447\u2013474 (1994)","journal-title":"Journal of Algorithms"},{"key":"43_CR18","unstructured":"Levine, M.S.: Faster Randomized Algorithms for Computing Minimum 3, 4, 5, 6-way Cuts. In: Proceedings of the Eleventh ACM-SIAM Symposium on Discrete Algorithms, pp. 735\u2013742 (2000)"},{"key":"43_CR19","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: Computing the Edge-Connectivity of Multigraphs and Capacitated Graphs. SIAM Journal on Discrete Mathematics\u00a05, 54\u201366 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"43_CR20","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/PL00011383","volume":"88","author":"H. Nagamochi","year":"2000","unstructured":"Nagamochi, H., Ibaraki, T.: A Fast Algorithm for Computing Minimum 3-way and 4-way Cuts. Mathematical Programming\u00a088, 507\u2013520 (2000)","journal-title":"Mathematical Programming"},{"key":"43_CR21","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1137\/S0895480194271323","volume":"10","author":"H. Nagamochi","year":"1997","unstructured":"Nagamochi, H., Nishimura, K., Ibaraki, T.: Computing all Small Cuts in Undirected Networks. SIAM Journal on Discrete Mathematics\u00a010, 469\u2013481 (1997)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"43_CR22","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1009804919645","volume":"4","author":"H. Nagamochi","year":"2000","unstructured":"Nagamochi, H., Nishimura, K., Ibaraki, T.: A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. Journal of Combinatorial Optimization\u00a04, 151\u2013169 (2000)","journal-title":"Journal of Combinatorial Optimization"},{"key":"43_CR23","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/BFb0120902","volume":"13","author":"J.C. Picard","year":"1980","unstructured":"Picard, J.C., Queyrane, M.: On the Structure of All Minimum Cuts in a Network and Applications. Mathematical Programming Study\u00a013, 8\u201316 (1980)","journal-title":"Mathematical Programming Study"},{"key":"43_CR24","doi-asserted-by":"crossref","unstructured":"Vazirani, V., Yannakakis, M.: Suboptimal Cuts: Their Enumeration, Weight and Number. In: Proceedings of the 19th International Colloquium on Automata, Languages and Programming, pp. 366\u2013377 (1992)","DOI":"10.1007\/3-540-55719-9_88"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:44:54Z","timestamp":1620017094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}