The Shortest Path Problem for a Multiple Graph
In the article, the definition of an undirected multiple graph of any natural multiplicity k > 1 is stated. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is the union of k linked edges, which connect 2 or k+1 vertices, correspo...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2017-12-01
|
| Series: | Modelirovanie i Analiz Informacionnyh Sistem |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/615 |