Embedding Trees in a Hypercube is NP-Complete (Q3476279): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: A. S. Wagner / rank | |||
| Property / author | |||
| Property / author: Q175509 / rank | |||
| Property / author | |||
| Property / author: A. S. Wagner / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Derek Gordon Corneil / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0219038 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033562398 / rank | |||
Normal rank | |||
Latest revision as of 23:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding Trees in a Hypercube is NP-Complete |
scientific article |
Statements
Embedding Trees in a Hypercube is NP-Complete (English)
0 references
1990
0 references
multiprocessor
0 references
graph embedding
0 references
hypercube
0 references
NP-complete
0 references
