Andrey Grishkevich. Algorithm for Finding Minimal and Quaziminimal st-Cuts in Graph. In Michal Choras, Ryszard S. Choras, editors, Image Processing and Communications - Techniques, Algorithms and Applications, IP&C'2019, Bydgoszcz, Poland, 11-13 September 2019, Proceedings. Volume 1062 of Advances in Intelligent Systems and Computing, pages 65-72, Springer, 2019. [doi]
@inproceedings{Grishkevich19,
title = {Algorithm for Finding Minimal and Quaziminimal st-Cuts in Graph},
author = {Andrey Grishkevich},
year = {2019},
doi = {10.1007/978-3-030-31254-1_9},
url = {https://doi.org/10.1007/978-3-030-31254-1_9},
researchr = {https://researchr.org/publication/Grishkevich19},
cites = {0},
citedby = {0},
pages = {65-72},
booktitle = {Image Processing and Communications - Techniques, Algorithms and Applications, IP&C'2019, Bydgoszcz, Poland, 11-13 September 2019, Proceedings},
editor = {Michal Choras and Ryszard S. Choras},
volume = {1062},
series = {Advances in Intelligent Systems and Computing},
publisher = {Springer},
isbn = {978-3-030-31254-1},
}