@inproceedings{conte:hal-01964710, TITLE = {{Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts}}, AUTHOR = {Conte, Alessio and Grossi, Roberto P and Marino, Andrea and Rizzi, Romeo and Uno, Takeaki and Versari, Luca P}, URL = {https://inria.hal.science/hal-01964710}, BOOKTITLE = {{WG 2018 - International Workshop on Graph-Theoretic Concepts in Computer Science}}, ADDRESS = {Cottbus, Germany}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {11159}, PAGES = {100-110}, YEAR = {2018}, MONTH = Jun, DOI = {10.1007/978-3-030-00256-5\_9}, PDF = {https://inria.hal.science/hal-01964710/file/main.pdf}, HAL_ID = {hal-01964710}, HAL_VERSION = {v1}, }