Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595)
From MaRDI portal
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