On the complexity of finding multi-constrained spanning trees (Q1171508): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Complexity of spanning tree problems: Part I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Bounded Path Tree Problem / rank | |||
Normal rank | |||
Latest revision as of 16:24, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding multi-constrained spanning trees |
scientific article |
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
