NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3 (Q5870845)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3 |
scientific article; zbMATH DE number 7645042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3 |
scientific article; zbMATH DE number 7645042 |
Statements
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3 (English)
0 references
24 January 2023
0 references
multiple graph
0 references
multiple tree
0 references
divisible graph
0 references
spanning tree
0 references
complete spanning tree
0 references
minimum spanning tree
0 references
NP-completeness
0 references
