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...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Статья |
| Jazyk: | English |
| Vydáno: |
Pleiades journals
2021
|
| Témata: | |
| On-line přístup: | https://dspace.ncfu.ru/handle/20.500.12258/15449 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|
| Shrnutí: | 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 finding vertex biconnected components and graph bridges is established, and based on this their complete solutions are given. Simplifying techniques for the calculation of the sets of paths based on the addition of auxiliary edges and vertices to the analyzed graph are proposed. Examples of the application of the developed apparatus to problems of the real-time management of transport networks are given |
|---|