Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of Finding Embeddings in a k-Tree |
scientific article; zbMATH DE number 3987300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Finding Embeddings in a <i>k</i>-Tree |
scientific article; zbMATH DE number 3987300 |
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
0 references
0.8559250831604004
0 references
0.850196123123169
0 references
0.8409733176231384
0 references
