{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:35:28Z","timestamp":1743021328116,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":10,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_168","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:38:09Z","timestamp":1214505489000},"page":"364-366","source":"Crossref","is-referenced-by-count":2,"title":["Gomory\u2013Hu Trees"],"prefix":"10.1007","author":[{"given":"Debmalya","family":"Panigrahi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"168_CR1_168","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0097539792236730","volume":"24","author":"A.A. Bencz\u00far","year":"1995","unstructured":"Bencz\u00far, A.A.: Counterexamples for Directed and Node Capacitated Cut-Trees. SIAM J.\u00a0Comput. 24(3), 505\u2013510 (1995)","journal-title":"SIAM J. Comput."},{"key":"168_CR2_168","doi-asserted-by":"crossref","unstructured":"Bhalgat, A., Hariharan, R., Kavitha, T., Panigrahi, D.: An $$ { \\tilde{O}(mn) } $$ Gomory-Hu tree construction algorithm for unweighted graphs. In: Proc. of the 39th Annual ACM Symposium on Theory of Computing, San Diego 2007","DOI":"10.1145\/1250790.1250879"},{"key":"168_CR3_168","doi-asserted-by":"crossref","unstructured":"Cole, R., Hariharan, R.: A\u00a0Fast Algorithm for Computing Steiner Edge Connectivity. In: Proc. of the 35th Annual ACM Symposium on Theory of Computing, San Diego 2003, pp.\u00a0167\u2013176","DOI":"10.1145\/780542.780568"},{"key":"168_CR4_168","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\u00a0matroid approach to finding edge connectivity and packing arborescences. J.\u00a0Comput. Syst. Sci. 50, 259\u2013273 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"168_CR5_168","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the Flow Decomposition Barrier. J. ACM 45(5), 783\u2013797 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"168_CR6_168","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jagm.2000.1136","volume":"38","author":"A.V. Goldberg","year":"2001","unstructured":"Goldberg, A.V., Tsioutsiouliklis, K.: Cut Tree Algorithms: An Experimental Study. J.\u00a0Algorithms 38(1), 51\u201383 (2001)","journal-title":"J. Algorithms"},{"issue":"4","key":"168_CR7_168","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J.\u00a0Soc. Indust. Appl. Math. 9(4), 551\u2013570 (1961)","journal-title":"J. Soc. Indust. Appl. Math."},{"issue":"1","key":"168_CR8_168","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/0219009","volume":"19","author":"D. Gusfield","year":"1990","unstructured":"Gusfield, D.: Very Simple Methods for All Pairs Network Flow Analysis. SIAM J. Comput. 19(1), 143\u2013155 (1990)","journal-title":"SIAM J. Comput."},{"key":"168_CR9_168","unstructured":"Hariharan, R., Kavitha, T., Panigrahi, D.: Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems. In: Proc. of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, pp.\u00a0127\u2013136"},{"key":"168_CR10_168","doi-asserted-by":"crossref","unstructured":"Karger, D., Levine, M.: Random Sampling in Residual Graphs. In: Proc. of the 34th Annual ACM Symposium on Theory of Computing 2002, pp.\u00a063\u201366","DOI":"10.1145\/509907.509918"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T02:17:49Z","timestamp":1662171469000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_168"}},"subtitle":["2007; Bhalgat, Hariharan, Kavitha, Panigrahi"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_168","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}