(1)
Лемешко, А.; Еременко, А.; Персиков, А.; Слейман, Б. Model of Secure Routing Based on Determining the Maximum Number of Disjoint Paths to Minimize the Probability of Compromise the Confidential Messages. RT 2019, 2, 31-37.