The complexity of restricted spanning tree problems (Q3936213): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/322307.322309 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2079828065 / rank | |||
Normal rank | |||
Latest revision as of 23:42, 19 March 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
