md-MST is NP-hard for \(d\geq 3\) (Q2883542)
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: md-MST is NP-hard for \(d\geq 3\) |
scientific article; zbMATH DE number 6033901
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | md-MST is NP-hard for \(d\geq 3\) |
scientific article; zbMATH DE number 6033901 |
Statements
13 May 2012
0 references
spanning tree
0 references
node degree constraints
0 references
computational complexity
0 references
proof by reduction
0 references
0 references
0 references
0.8031933
0 references
0.7936605
0 references
0.78781855
0 references
0.78660023
0 references
0.7828279
0 references
0.78190625
0 references
0.78173363
0 references
md-MST is NP-hard for \(d\geq 3\) (English)
0 references
