The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph
In this paper, we study undirected multiple graphs of any natural multiplicity к > 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 к linked edges, which connect 2 or (к + 1) vertices, correspondingly. The linked edge...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2022-12-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1753 |