Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. Conte, A., Grossi, R., Marino, A., Rizzi, R., Uno, T., & Versari, L. In Brandstädt, A., Köhler, E., & Meer, K., editors, Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings, volume 11159, of Lecture Notes in Computer Science, pages 100–110, 2018. Springer.
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/wg/ConteGMRUV18,
  author       = {Alessio Conte and
                  Roberto Grossi and
                  Andrea Marino and
                  Romeo Rizzi and
                  Takeaki Uno and
                  Luca Versari},
  editor       = {Andreas Brandst{\"{a}}dt and
                  Ekkehard K{\"{o}}hler and
                  Klaus Meer},
  title        = {Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 44th International
                  Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11159},
  pages        = {100--110},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-030-00256-5\_9},
  doi          = {10.1007/978-3-030-00256-5\_9},
  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/ConteGMRUV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0