Determination of the Maximum Set Independent Simple Paths between the Vertices of the Graph
This article presents an algorithm for determining the maximum number of independent simple paths, as well as the paths themselves, between the given vertices of the graph. This task is extremely important in the theory of communication, its solution is necessary to ensure the stability of the commu...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
The Fund for Promotion of Internet media, IT education, human development «League Internet Media»
2021-06-01
|
| Series: | Современные информационные технологии и IT-образование |
| Subjects: | |
| Online Access: | http://sitito.cs.msu.ru/index.php/SITITO/article/view/738 |