Embedding Trees in a Hypercube is NP-Complete (Q3476279): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:28, 4 February 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
