Construction of simple path graphs in transport networks: I. general solutions and examples
The calculation of the set of all simple paths connecting two vertices of an undirected graph is considered. The more general problems of connecting vertices which belong to disjoint sets of vertices in a graph by all simple paths are also investigated. The connection between these problems and find...
Сохранить в:
| Главные авторы: | , |
|---|---|
| 格式: | Статья |
| 語言: | English |
| 出版: |
Pleiades journals
2021
|
| 主題: | |
| 在線閱讀: | https://dspace.ncfu.ru/handle/20.500.12258/15449 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|