{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T03:26:27Z","timestamp":1768274787237,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,11]]},"DOI":"10.1145\/1250790.1250879","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"605-614","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["An \u00d5(mn) Gomory-Hu tree construction algorithm for unweighted graphs"],"prefix":"10.1145","author":[{"given":"Ramesh","family":"Hariharan","sequence":"first","affiliation":[{"name":"Strand Life Sciences and House of Algorithms, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Telikepalli","family":"Kavitha","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debmalya","family":"Panigrahi","sequence":"additional","affiliation":[{"name":"Bell Labs Research, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Bhalgat","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142993226983"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792236730"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780568"},{"key":"e_1_3_2_1_4_1","first-page":"69","volume-title":"Gordon and Breach","author":"Edmonds J.","year":"1969","unstructured":"J. Edmonds , Submodular functions, matroids , and certain polyhedra Calgary International Conference on Combinatorial Structures and their Applicati on , Gordon and Breach , New York , 1969 , pp. 69 -- 87 . J. Edmonds, Submodular functions, matroids, and certain polyhedra Calgary International Conference on Combinatorial Structures and their Applicati on, Gordon and Breach, New York, 1969, pp. 69--87."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1022"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290181"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1136"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219009"},{"key":"e_1_3_2_1_10_1","first-page":"127","volume-title":"Proc. of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Hariharan R.","year":"2007","unstructured":"R. Hariharan , T. Kavitha , and D. Panigrahi , Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems , Proc. of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 127 -- 136 , 2007 . R. Hariharan, T. Kavitha, and D. Panigrahi, Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems, Proc. of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 127--136, 2007."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276714"}],"event":{"name":"STOC07: Symposium on Theory of Computing","location":"San Diego California USA","acronym":"STOC07","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-ninth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250879","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250790.1250879","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:21Z","timestamp":1750258341000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250879"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":11,"alternative-id":["10.1145\/1250790.1250879","10.1145\/1250790"],"URL":"https:\/\/doi.org\/10.1145\/1250790.1250879","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}