Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29013861, #quickstatements; #temporary_batch_1704785786528 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:21, 5 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
