{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T03:46:58Z","timestamp":1754020018950},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584346"},{"type":"electronic","value":"9783540487944"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0049404","type":"book-chapter","created":{"date-parts":[[2006,3,6]],"date-time":"2006-03-06T18:42:35Z","timestamp":1141670555000},"page":"141-147","source":"Crossref","is-referenced-by-count":35,"title":["A simple min cut algorithm"],"prefix":"10.1007","author":[{"given":"Mechthild","family":"Stoer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,2,23]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM 34 (1987) 596\u2013615","journal-title":"Journal of the ACM"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L. R. Ford","year":"1956","unstructured":"L. R. Ford, D. R. Fulkerson, Maximal flow through a network, Canadian Journal on Mathematics 8 (1956) 399\u2013404","journal-title":"Canadian Journal on Mathematics"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A. V. Goldberg","year":"1988","unstructured":"A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow problem, Journal of the ACM 35 (1988) 921\u2013940","journal-title":"Journal of the ACM"},{"key":"14_CR4","first-page":"551","volume":"9","author":"R. E. Gomory","year":"1961","unstructured":"R. E. Gomory, Multi-terminal network flows, Journal of the SIAM 9 (1961) 551\u2013570","journal-title":"Journal of the SIAM"},{"key":"14_CR5","unstructured":"X. Hao and J. B. Orlin, A faster algorithm for finding the minimum cut in a graph, 3rd ACM-SIAM Symposium on Discrete Algorithms (1992) 165\u2013174"},{"key":"14_CR6","unstructured":"D. W. Matula\nA linear time 2+\u03b5 approximation algorithm for edge connectivity, Proceedings of the 4th ACM-SIAM Symposium on Discrete Mathematics (1993) 500\u2013504"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"H. Nagamochi and T. Ibaraki, Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica 7 (1992) 583\u2013596","journal-title":"Algorithmica"},{"key":"14_CR8","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 edge-connectivity in multigraphs and capacitated graphs, SIAM Journal on Discrete Mathematics 5 (1992) 54\u201366","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"14_CR9","unstructured":"T. Nishizeki and S. Poljak, Highly connected factors with a small number of edges, Preprint (1989)"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. C. Prim","year":"1957","unstructured":"R. C. Prim, Shortest connection networks and some generalizations, Bell System Technical Journal 36 (1957) 1389\u20131401","journal-title":"Bell System Technical Journal"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0049404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T22:44:02Z","timestamp":1549752242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0049404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584346","9783540487944"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0049404","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}