{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:36:10Z","timestamp":1725525370202},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_20","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"226-237","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Cuts of Simple Graphs in Almost Always Linear Time"],"prefix":"10.1007","author":[{"given":"Michael","family":"Brinkmeier","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Bauer, S.: RNA Sekund\u00e4rstrukturvorhersage. Studienarbeit, TU Ilmenau (April 2004)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00224-007-2010-2","volume":"41","author":"M. Brinkmeier","year":"2007","unstructured":"Brinkmeier, M.: A simple and fast min-cut algorithm. Theory of Computing Systems\u00a041, 369\u2013380 (2007)","journal-title":"Theory of Computing Systems"},{"key":"20_CR3","unstructured":"Chekuri, C., Goldberg, A.V., Karger, D.R., Levine, M.S., Stein, C.: Experimental study of minimum cut algorithms. In: Symposium on Discrete Algorithms, pp. 324\u2013333 (1997)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math.\u00a08, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1006\/jcss.1995.1022","volume":"50","author":"H.N. Gabow","year":"1995","unstructured":"Gabow, H.N.: A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci.\u00a050(2), 259\u2013273 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_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. J. Assoc. Comput. Mach.\u00a035, 921\u2013940 (1988)","journal-title":"J. Assoc. Comput. Mach."},{"key":"20_CR7","first-page":"551","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J. SIAM\u00a09, 551\u2013570 (1961)","journal-title":"J. SIAM"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Karger, D.R.: Minimum cuts in near-linear time. In: STOC, pp. 56\u201363 (1996)","DOI":"10.1145\/237814.237829"},{"key":"20_CR9","unstructured":"Karger, D.R.: Minimum cuts in near-linear time. CoRR, cs.DS\/9812007 (1998)"},{"issue":"4","key":"20_CR10","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. J. ACM\u00a043(4), 601\u2013640 (1996)","journal-title":"J. ACM"},{"key":"20_CR11","unstructured":"Matula, D.W.: A linear time 2+epsilon approximation algorithm for edge connectivity. In: SODA, pp. 500\u2013504 (1993)"},{"key":"20_CR12","unstructured":"Nagamochi, H., Ishii, Ibaraki, T.: A simple proof of a minimum cut algorithm and its applications. TIEICE: IEICE Transactions on Communications\/Electronics\/Information and Systems (1999)"},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Disc. Math.\u00a05(1), 54\u201366 (1992)","journal-title":"SIAM J. Disc. Math."},{"issue":"5&6","key":"20_CR14","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica\u00a07(5&6), 583\u2013596 (1992)","journal-title":"Algorithmica"},{"issue":"1-3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0166-218X(01)00349-3","volume":"123","author":"H. Nagamochi","year":"2002","unstructured":"Nagamochi, H., Ibaraki, T.: Graph connectivity and its augmentation: applications of MA orderings. Discrete Applied Mathematics\u00a0123(1-3), 447\u2013472 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-58325-4_181","volume-title":"Algorithms and Computation","author":"H. Nagamochi","year":"1994","unstructured":"Nagamochi, H., Nishimura, K., Ibaraki, T.: Computing all small cuts in undirected networks. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol.\u00a0834, pp. 190\u2013198. Springer, Heidelberg (1994)"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01582226","volume":"67","author":"H. Nagamochi","year":"1994","unstructured":"Nagamochi, H., Ono, T., Ibaraki, T.: Implementing an efficient minimum capacity cut algorithm. Math. Program.\u00a067, 325\u2013341 (1994)","journal-title":"Math. Program."},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01580850","volume":"47","author":"M. Padberg","year":"1990","unstructured":"Padberg, M., Rinaldi, G.: An efficient algorithm for the minimum capacity cut problem. Math. Program.\u00a047, 19\u201336 (1990)","journal-title":"Math. Program."},{"issue":"4","key":"20_CR19","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M. Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. Journal of the ACM\u00a044(4), 585\u2013591 (1997)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T07:41:44Z","timestamp":1551771704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}