{"page":"13-26","status":"public","year":"2022","publisher":"Society for Industrial and Applied Mathematics","day":"01","external_id":{"arxiv":["2101.05033"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2022-01-01T00:00:00Z","oa":1,"article_processing_charge":"No","citation":{"apa":"Henzinger, M. H., Noe, A., &#38; Schulz, C. (2022). Practical fully dynamic minimum cut algorithms. In <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i> (pp. 13–26). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977042.2\">https://doi.org/10.1137/1.9781611977042.2</a>","chicago":"Henzinger, Monika H, Alexander Noe, and Christian Schulz. “Practical Fully Dynamic Minimum Cut Algorithms.” In <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>, 13–26. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/1.9781611977042.2\">https://doi.org/10.1137/1.9781611977042.2</a>.","ista":"Henzinger MH, Noe A, Schulz C. 2022. Practical fully dynamic minimum cut algorithms. 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 13–26.","ieee":"M. H. Henzinger, A. Noe, and C. Schulz, “Practical fully dynamic minimum cut algorithms,” in <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>, Alexandria, VA, United States, 2022, pp. 13–26.","mla":"Henzinger, Monika H., et al. “Practical Fully Dynamic Minimum Cut Algorithms.” <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>, Society for Industrial and Applied Mathematics, 2022, pp. 13–26, doi:<a href=\"https://doi.org/10.1137/1.9781611977042.2\">10.1137/1.9781611977042.2</a>.","ama":"Henzinger MH, Noe A, Schulz C. Practical fully dynamic minimum cut algorithms. In: <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>. Society for Industrial and Applied Mathematics; 2022:13-26. doi:<a href=\"https://doi.org/10.1137/1.9781611977042.2\">10.1137/1.9781611977042.2</a>","short":"M.H. Henzinger, A. Noe, C. Schulz, in:, 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2022, pp. 13–26."},"date_created":"2022-08-19T07:27:51Z","month":"01","doi":"10.1137/1.9781611977042.2","author":[{"first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Noe","full_name":"Noe, Alexander","first_name":"Alexander"},{"last_name":"Schulz","first_name":"Christian","full_name":"Schulz, Christian"}],"conference":{"name":"ALENEX: Symposium on Algorithm Engineering and Experiments","location":"Alexandria, VA, United States","start_date":"2022-01-09","end_date":"2022-01-10"},"_id":"11930","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2101.05033"}],"title":"Practical fully dynamic minimum cut algorithms","scopus_import":"1","quality_controlled":"1","publication":"2022 Proceedings of the Symposium on Algorithm Engineering and Experiments","publication_status":"published","abstract":[{"lang":"eng","text":"We present a practically efficient algorithm for maintaining a global minimum cut in large dynamic graphs under both edge insertions and deletions. While there has been theoretical work on this problem, our algorithm is the first implementation of a fully-dynamic algorithm. The algorithm uses the theoretical foundation and combines it with efficient and finely-tuned implementations to give an algorithm that can maintain the global minimum cut of a graph with rapid update times. We show that our algorithm gives up to multiple orders of magnitude speedup compared to static approaches both on edge insertions and deletions."}],"oa_version":"Preprint","date_updated":"2023-02-17T13:57:17Z","type":"conference","extern":"1","publication_identifier":{"eisbn":["978-1-61197-704-2"]},"language":[{"iso":"eng"}]}