Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0608024 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085550081 / rank | |||
Normal rank | |||
Revision as of 23:01, 19 March 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
