NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3 (Q5870845): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3651735 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5668821 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Metagraphs and their applications. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3292914 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reducibility among Combinatorial Problems / rank | |||
Normal rank | |||
Latest revision as of 08:41, 31 July 2024
scientific article; zbMATH DE number 7645042
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
