On the complexity of finding multi-constrained spanning trees (Q1171508)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3786521
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of finding multi-constrained spanning trees |
scientific article; zbMATH DE number 3786521 |
Statements
On the complexity of finding multi-constrained spanning trees (English)
0 references
1983
0 references
classification of undirected spanning tree problems
0 references
computational complexity
0 references
undirected, unweighted graph
0 references
multi-constrained, unweighted case
0 references
