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, correspondin...
में बचाया:
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
Yaroslavl State University
2017-12-01
|
| श्रृंखला: | Моделирование и анализ информационных систем |
| विषय: | |
| ऑनलाइन पहुंच: | https://www.mais-journal.ru/jour/article/view/615 |
| टैग: |
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|