NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
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 edges...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Yaroslavl State University
2021-03-01
|
| Col·lecció: | Моделирование и анализ информационных систем |
| Matèries: | |
| Accés en línia: | https://www.mais-journal.ru/jour/article/view/1470 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|