Janiga, Ladislav; Koubek, Václav Minimum cut in directed planar networks. (English) Zbl 0763.90084 Kybernetika 28, No. 1, 37-49 (1992). MSC: 90C35 90C60 PDFBibTeX XMLCite \textit{L. Janiga} and \textit{V. Koubek}, Kybernetika 28, No. 1, 37--49 (1992; Zbl 0763.90084) Full Text: EuDML Link
Janiga, Ladislav; Koubek, Vaclav A note on finding minimum cuts in directed planar networks by parallel computations. (English) Zbl 0583.90026 Inf. Process. Lett. 21, 75-78 (1985). Reviewer: P.Brucker MSC: 90B10 90C35 05C35 PDFBibTeX XMLCite \textit{L. Janiga} and \textit{V. Koubek}, Inf. Process. Lett. 21, 75--78 (1985; Zbl 0583.90026) Full Text: DOI
Koubek, Vaclav; Riha, Antonin The maximum k-flow in a network. (English) Zbl 0471.90049 Mathematical foundations of computer science 1981, Proc. 10th Symp., Strbske Pleso/Czech. 1981, Lect. Notes Comput. Sci. 118, 389-397 (1981). MSC: 90B10 68Q25 05C35 PDFBibTeX XML
Adámek, Jiří; Koubek, Vaćlav Remarks on flows in network with short paths. (English) Zbl 0223.05108 Commentat. Math. Univ. Carol. 12, 661-667 (1971). MSC: 90B10 PDFBibTeX XMLCite \textit{J. Adámek} and \textit{V. Koubek}, Commentat. Math. Univ. Carol. 12, 661--667 (1971; Zbl 0223.05108) Full Text: EuDML