{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:53:16Z","timestamp":1744217596989},"publisher-location":"New York, NY","reference-count":11,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_168","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T20:15:58Z","timestamp":1553112958000},"page":"858-861","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Gomory-Hu Trees"],"prefix":"10.1007","author":[{"given":"Debmalya","family":"Panigrahi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"3","key":"159_CR7191","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0097539792236730","volume":"24","author":"AA Bencz\u00far","year":"1995","unstructured":"Bencz\u00far AA (1995) Counterexamples for directed and node capacitated cut-trees. SIAM J Comput 24(3):505\u2013510","journal-title":"SIAM J Comput"},{"key":"159_CR7192","doi-asserted-by":"crossref","unstructured":"Bhalgat A, Hariharan R, Kavitha T, Panigrahi D (2007) An \u00d5 ( m n ) $$\\tilde{O}(mn)$$ Gomory-Hu tree construction algorithm for unweighted graphs. In: Proceedings of the 39th annual ACM symposium on theory of computing, San Diego","DOI":"10.1145\/1250790.1250879"},{"key":"159_CR7193","doi-asserted-by":"crossref","unstructured":"Borradaile G, Sankowski P, Wulff-Nilsen C (2010) Min st-cut Oracle for planar graphs with near-linear preprocessing time. In: Proceedings of the 51th annual IEEE symposium on foundations of computer science, Las Vegas, pp\u00a0601\u2013610","DOI":"10.1109\/FOCS.2010.63"},{"key":"159_CR7194","doi-asserted-by":"crossref","unstructured":"Cole R, Hariharan R (2003) A fast algorithm for computing steiner edge connectivity. In: Proceedings of the 35th annual ACM symposium on theory of computing, San Diego, pp 167\u2013176","DOI":"10.1145\/780542.780568"},{"key":"159_CR7195","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1006\/jcss.1995.1022","volume":"50","author":"HN Gabow","year":"1995","unstructured":"Gabow HN (1995) A matroid approach to finding edge connectivity and packing arborescences. J Comput Syst Sci 50:259\u2013273","journal-title":"J Comput Syst Sci"},{"issue":"5","key":"159_CR7196","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"AV Goldberg","year":"1998","unstructured":"Goldberg AV, Rao S (1998) Beyond the flow decomposition barrier. J ACM 45(5):783\u2013797","journal-title":"J ACM"},{"issue":"1","key":"159_CR7197","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jagm.2000.1136","volume":"38","author":"AV Goldberg","year":"2001","unstructured":"Goldberg AV, Tsioutsiouliklis K (2001) Cut tree algorithms: an experimental study. J Algorithms 38(1):51\u201383","journal-title":"J Algorithms"},{"issue":"4","key":"159_CR7198","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory RE, Hu TC (1961) Multi-terminal network flows. J Soc Ind Appl Math 9(4):551\u2013570","journal-title":"J Soc Ind Appl Math"},{"issue":"1","key":"159_CR7199","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/0219009","volume":"19","author":"D Gusfield","year":"1990","unstructured":"Gusfield D (1990) Very simple methods for all pairs network flow analysis. SIAM J Comput 19(1):143\u2013155","journal-title":"SIAM J Comput"},{"key":"159_CR7200","unstructured":"Hariharan R, Kavitha T, Panigrahi D (2007) Efficient algorithms for computing all low s-t edge connectivities and related problems. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms, New Orleans, pp\u00a0127\u2013136"},{"key":"159_CR7201","doi-asserted-by":"crossref","unstructured":"Karger D, Levine M (2002) Random sampling in residual graphs. In: Proceedings of the 34th annual ACM symposium on theory of computing, Montreal, pp\u00a063\u201366","DOI":"10.1145\/509907.509918"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T00:04:38Z","timestamp":1574381078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_168","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}