{"title":"On the number of small cuts in a graph","doi":"10.1016/0020-0190(96)00079-8","date_updated":"2022-09-12T09:39:51Z","month":"07","author":[{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"David P.","last_name":"Williamson","full_name":"Williamson, David P."}],"volume":59,"_id":"11761","article_processing_charge":"No","scopus_import":"1","date_published":"1996-07-08T00:00:00Z","publication":"Information Processing Letters","publication_status":"published","date_created":"2022-08-08T11:49:48Z","day":"08","citation":{"apa":"Henzinger, M. H., &#38; Williamson, D. P. (1996). On the number of small cuts in a graph. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(96)00079-8\">https://doi.org/10.1016/0020-0190(96)00079-8</a>","chicago":"Henzinger, Monika H, and David P. Williamson. “On the Number of Small Cuts in a Graph.” <i>Information Processing Letters</i>. Elsevier, 1996. <a href=\"https://doi.org/10.1016/0020-0190(96)00079-8\">https://doi.org/10.1016/0020-0190(96)00079-8</a>.","mla":"Henzinger, Monika H., and David P. Williamson. “On the Number of Small Cuts in a Graph.” <i>Information Processing Letters</i>, vol. 59, no. 1, Elsevier, 1996, pp. 41–44, doi:<a href=\"https://doi.org/10.1016/0020-0190(96)00079-8\">10.1016/0020-0190(96)00079-8</a>.","short":"M.H. Henzinger, D.P. Williamson, Information Processing Letters 59 (1996) 41–44.","ista":"Henzinger MH, Williamson DP. 1996. On the number of small cuts in a graph. Information Processing Letters. 59(1), 41–44.","ama":"Henzinger MH, Williamson DP. On the number of small cuts in a graph. <i>Information Processing Letters</i>. 1996;59(1):41-44. doi:<a href=\"https://doi.org/10.1016/0020-0190(96)00079-8\">10.1016/0020-0190(96)00079-8</a>","ieee":"M. H. Henzinger and D. P. Williamson, “On the number of small cuts in a graph,” <i>Information Processing Letters</i>, vol. 59, no. 1. Elsevier, pp. 41–44, 1996."},"type":"journal_article","page":"41-44","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","article_type":"original","extern":"1","intvolume":"        59","publisher":"Elsevier","quality_controlled":"1","language":[{"iso":"eng"}],"issue":"1","year":"1996","abstract":[{"text":"We prove that in an undirected graph there are at most O(n²) cuts of size strictly less than of the size of the minimum cut.","lang":"eng"}],"publication_identifier":{"issn":["0020-0190"]}}