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...
Sparad:
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Статья |
| Språk: | English |
| Publicerad: |
Pleiades journals
2021
|
| Ämnen: | |
| Länkar: | https://dspace.ncfu.ru/handle/20.500.12258/15449 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|