md-MST is NP-hard for (Q2883542)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | md-MST is NP-hard for |
scientific article |
Statements
md-MST is NP-hard for (English)
0 references
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
