The complexity of restricted spanning tree problems (Q3936213): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:30, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of restricted spanning tree problems |
scientific article |
Statements
The complexity of restricted spanning tree problems (English)
0 references
1982
0 references
traveling salesman problem
0 references
network problems
0 references
NP-complete
0 references
polynomial algorithm
0 references
matching
0 references
