The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
In this paper, we study undirected multiple graphs of any natural multiplicity $k>1$. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of $k$ linked edges, which connect 2 or $(k+1)$ vertices, correspondingly. The linked ed...
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Artikkeli |
| Kieli: | English |
| Julkaistu: |
Yaroslavl State University
2023-04-01
|
| Sarja: | Моделирование и анализ информационных систем |
| Aiheet: | |
| Linkit: | https://www.mais-journal.ru/jour/article/view/1763 |