pdf-format: |
|
@InProceedings{henzinger_et_al:LIPIcs:2020:12925, author = {Monika Henzinger and Alexander Noe and Christian Schulz and Darren Strash}, title = {{Finding All Global Minimum Cuts in Practice}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {59:1--59:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Fabrizio Grandoni and Grzegorz Herman and Peter Sanders}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12925}, URN = {urn:nbn:de:0030-drops-129255}, doi = {10.4230/LIPIcs.ESA.2020.59}, annote = {Keywords: Minimum Cut, Graph Algorithm, Algorithm Engineering, Cut Enumeration, Balanced Cut, Global Minimum Cut, Large-scale Graph Analysis} }
Keywords: | Minimum Cut, Graph Algorithm, Algorithm Engineering, Cut Enumeration, Balanced Cut, Global Minimum Cut, Large-scale Graph Analysis | |
Seminar: | 28th Annual European Symposium on Algorithms (ESA 2020) | |
Issue date: | 2020 | |
Date of publication: | 26.08.2020 | |
Supplementary Material: | https://github.com/VieCut/VieCut |