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. 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
{"_id":"jKoSSvEv7hf98Crp7","bibbaseid":"conte-grossi-marino-rizzi-uno-versari-tightlowerboundsforthenumberofinclusionminimalstcuts-2018","author_short":["Conte, A.","Grossi, R.","Marino, A.","Rizzi, R.","Uno, T.","Versari, L."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Alessio"],"propositions":[],"lastnames":["Conte"],"suffixes":[]},{"firstnames":["Roberto"],"propositions":[],"lastnames":["Grossi"],"suffixes":[]},{"firstnames":["Andrea"],"propositions":[],"lastnames":["Marino"],"suffixes":[]},{"firstnames":["Romeo"],"propositions":[],"lastnames":["Rizzi"],"suffixes":[]},{"firstnames":["Takeaki"],"propositions":[],"lastnames":["Uno"],"suffixes":[]},{"firstnames":["Luca"],"propositions":[],"lastnames":["Versari"],"suffixes":[]}],"editor":[{"firstnames":["Andreas"],"propositions":[],"lastnames":["Brandstädt"],"suffixes":[]},{"firstnames":["Ekkehard"],"propositions":[],"lastnames":["Köhler"],"suffixes":[]},{"firstnames":["Klaus"],"propositions":[],"lastnames":["Meer"],"suffixes":[]}],"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","bibtex":"@inproceedings{DBLP:conf/wg/ConteGMRUV18,\n author = {Alessio Conte and\n Roberto Grossi and\n Andrea Marino and\n Romeo Rizzi and\n Takeaki Uno and\n Luca Versari},\n editor = {Andreas Brandst{\\\"{a}}dt and\n Ekkehard K{\\\"{o}}hler and\n Klaus Meer},\n title = {Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts},\n booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International\n Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},\n series = {Lecture Notes in Computer Science},\n volume = {11159},\n pages = {100--110},\n publisher = {Springer},\n year = {2018},\n url = {https://doi.org/10.1007/978-3-030-00256-5\\_9},\n doi = {10.1007/978-3-030-00256-5\\_9},\n timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/wg/ConteGMRUV18.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Conte, A.","Grossi, R.","Marino, A.","Rizzi, R.","Uno, T.","Versari, L."],"editor_short":["Brandstädt, A.","Köhler, E.","Meer, K."],"key":"DBLP:conf/wg/ConteGMRUV18","id":"DBLP:conf/wg/ConteGMRUV18","bibbaseid":"conte-grossi-marino-rizzi-uno-versari-tightlowerboundsforthenumberofinclusionminimalstcuts-2018","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-030-00256-5\\_9"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/57/7900.bib","dataSources":["kdGZkBFQjQnnvMnEr"],"keywords":[],"search_terms":["tight","lower","bounds","number","inclusion","minimal","cuts","conte","grossi","marino","rizzi","uno","versari"],"title":"Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts","year":2018}