Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q221664 |
||
| Property / author | |||
| Property / author: Q175509 / rank | |||
Revision as of 06:55, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of Finding Embeddings in a <i>k</i>-Tree |
scientific article |
Statements
Complexity of Finding Embeddings in a <i>k</i>-Tree (English)
0 references
1987
0 references
algorithm complexity
0 references
NP completeness
0 references
k-tree
0 references
