{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:49Z","timestamp":1751282869613},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583257"},{"type":"electronic","value":"9783540486534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_181","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:43:19Z","timestamp":1330252999000},"page":"190-198","source":"Crossref","is-referenced-by-count":10,"title":["Computing all small cuts in undirected networks"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Nagamochi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiro","family":"Nishimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/net.1975.5.3.253","volume":"5","author":"R. Bixby","year":"1975","unstructured":"R. Bixby, The minimum number of edges and vertices in a graph with edge-connectivity n and m n-bonds, Networks, Vol.5, 1975, pp. 235\u2013298.","journal-title":"Networks"},{"key":"23_CR2","volume-title":"The combinatorics of network reliability","author":"C.J. Colbourn","year":"1987","unstructured":"C.J. Colbourn, The combinatorics of network reliability, Oxford University Press, New York Oxford, 1987."},{"key":"23_CR3","first-page":"290","volume-title":"Studies in Discrete Optimization (in Russian)","author":"E. Dinits","year":"1976","unstructured":"E. Dinits, A.V. Karzanov and M.V. Lomonosov, On the structure of a family of minimal weighed cuts in a graph, Studies in Discrete Optimization (in Russian), A. A. Fridman (Ed.), Nauka, Moscow, 1976, pp. 290\u2013306."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Mathematics, Vol.5, 1992, pp. 25\u201353.","journal-title":"SIAM J. Discrete Mathematics"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0012-365X(92)90589-8","volume":"101","author":"A. Frank","year":"1992","unstructured":"A. Frank, On a theorem of Mader, Discrete Mathematics, Vol.101, 1992, pp. 49\u201357.","journal-title":"Discrete Mathematics"},{"key":"23_CR6","unstructured":"D.R. Karger, Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm, Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 21\u201330."},{"key":"23_CR7","unstructured":"L. Lov\u00e1sz, Combinatorial Problems and Exercises, North-Holland 1979."},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","volume":"3","author":"W. Mader","year":"1978","unstructured":"W. Mader, A reduction method for edge-connectivity in graphs, Annals of Discrete Mathematics, Vol. 3, 1978, pp. 145\u2013164.","journal-title":"Annals of Discrete Mathematics"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagamochi","year":"1992","unstructured":"H. Nagamochi and T. Ibaraki, Computing the edge-connectivity of multigraphs and capacitated graphs, SIAM J. Discrete Mathematics, Vol 5, 1992, pp. 54\u201366.","journal-title":"SIAM J. Discrete Mathematics"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"H. Nagamochi, K. Nishimura and T. Ibaraki, Computing all small cuts in undirected networks, Technical Report #94007, Kyoto University, 1994.","DOI":"10.1007\/3-540-58325-4_181"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"D. Naor, D. Gusfield and C. Martel, A fast algorithm for optimally increasing the edge connectivity, Proceedings 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, pp. 698\u2013707.","DOI":"10.1109\/FSCS.1990.89592"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"V.V. Vazirani and M. Yannakakis, Suboptimal cuts: Their enumeration, weight, and number, Lecture Notes in Computer Science, Vol. 623, Springer-Verlag, 1992, pp. 366\u2013377.","DOI":"10.1007\/3-540-55719-9_88"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_181.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:19:28Z","timestamp":1605629968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_181","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}