{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:10:42Z","timestamp":1743081042719,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250041"},{"type":"electronic","value":"9783030250058"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-25005-8_20","type":"book-chapter","created":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T23:02:23Z","timestamp":1563145343000},"page":"237-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph"],"prefix":"10.1007","author":[{"given":"Rahul Raj","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Sushanta","family":"Karmakar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"issue":"2\u20133","key":"20_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(90)90030-L","volume":"72","author":"G Ausiello","year":"1990","unstructured":"Ausiello, G., Nanni, U., Italiano, G.F.: Dynamic maintenance of directed hypergraphs. Theor. Comput. Sci. 72(2\u20133), 97\u2013117 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Xu, C.: Computing minimum cuts in hypergraphs. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1085\u20131100. Society for Industrial and Applied Mathematics (2017)","DOI":"10.1137\/1.9781611974782.70"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s101070050032","volume":"84","author":"E Cheng","year":"1999","unstructured":"Cheng, E.: Edge-augmentation of hypergraphs. Math. Program. 84(3), 443\u2013465 (1999)","journal-title":"Math. Program."},{"key":"20_CR4","unstructured":"Dinits, E.A., Karzanov, A.V., Lomonosov, M.V.: On the structure of the system of minimum edge cuts in a graph. In: Investigations in Discrete Optimization, pp. 290\u2013306 (1976) (in Russian)"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/PL00009195","volume":"20","author":"Y Dinitz","year":"1998","unstructured":"Dinitz, Y., Westbrook, J.: Maintaining the classes of 4-edge-connectivity in a graph on-line. Algorithmica 20(3), 242\u2013276 (1998)","journal-title":"Algorithmica"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: A matroid approach to finding edge connectivity and packing arborescences. In: Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, pp. 112\u2013122. ACM (1991)","DOI":"10.1145\/103418.103436"},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/2764909","volume":"12","author":"HN Gabow","year":"2016","unstructured":"Gabow, H.N.: The minset-poset approach to representations of graph connectivity. ACM Trans. Algorithms 12(2), 24:1\u201324:73 (2016)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1137\/0222002","volume":"22","author":"Z Galil","year":"1993","unstructured":"Galil, Z., Italiano, G.F.: Maintaining the 3-edge-connected components of a graph on-line. SIAM J. Comput. 22(1), 11\u201328 (1993)","journal-title":"SIAM J. Comput."},{"key":"20_CR9","unstructured":"Goranci, G., Henzinger, M., Thorup, M.: Incremental exact min-cut in poly-logarithmic amortized update time. In: 24th Annual European Symposium on Algorithms, ESA 2016, 22\u201324 August 2016, Aarhus, Denmark, pp. 46:1\u201346:17 (2016)"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1006\/jagm.1997.0855","volume":"24","author":"MR Henzinger","year":"1997","unstructured":"Henzinger, M.R.: A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity. J. Algorithms 24(1), 194\u2013220 (1997)","journal-title":"J. Algorithms"},{"key":"20_CR11","unstructured":"Italiano, G.F., Nanni, U.: On-line maintenance of minimal directed hypergraphs. In: Italian Conference on Theoretical Computer Science, pp. 335\u2013349 (1989)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.I., Thorup, M.: Deterministic global minimum cut of a simple graph in near-linear time. In: Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing, pp. 665\u2013674. ACM (2015)","DOI":"10.1145\/2746539.2746588"},{"key":"20_CR13","unstructured":"Kilmmek, R., Wagner, F.: A simple hypergraph min cut algorithm. Technical Report B 96\u201302, Department of Mathematics and Computer Science, Freie Universit\u00e4t Berlin (1996)"},{"issue":"1\u20133","key":"20_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0012-365X(93)90376-5","volume":"114","author":"JA La Poutr\u00e9","year":"1993","unstructured":"La Poutr\u00e9, J.A., van Leeuwen, J., Overmars, M.H.: Maintenance of 2-and 3-edge-connected components of graphs. Discrete Math. 114(1\u20133), 329\u2013359 (1993)","journal-title":"Discrete Math."},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-9260(00)00008-0","volume":"30","author":"WK Mak","year":"2000","unstructured":"Mak, W.K., Wong, D.: A fast hypergraph min-cut algorithm for circuit partitioning. Integr. VLSI J. 30(1), 1\u201311 (2000)","journal-title":"Integr. VLSI J."},{"issue":"1","key":"20_CR16","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. Discrete Math. 5(1), 54\u201366 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20132","key":"20_CR17","first-page":"3","volume":"82","author":"M Queyranne","year":"1998","unstructured":"Queyranne, M.: Minimizing symmetric submodular functions. Math. Program. 82(1\u20132), 3\u201312 (1998)","journal-title":"Math. Program."},{"issue":"2","key":"20_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21(2), 267\u2013305 (1996)","journal-title":"J. Algorithms"},{"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. J. ACM (JACM) 44(4), 585\u2013591 (1997)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"20_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Van Leeuwen, J.: Worst-case analysis of set union algorithms. J. ACM (JACM) 31(2), 245\u2013281 (1984)","journal-title":"J. ACM (JACM)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25005-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:14:28Z","timestamp":1710350068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25005-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250041","9783030250058"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25005-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2019.di.unipi.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5-6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}