On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(92)90687-b / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076043677 / rank | |||
Normal rank | |||
Latest revision as of 11:17, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding iso- and other morphisms for partial \(k\)- trees |
scientific article |
Statements
On the complexity of finding iso- and other morphisms for partial \(k\)- trees (English)
0 references
17 January 1993
0 references
partial \(k\)-tree
0 references
NP-complete
0 references
complexity
0 references
polynomial algorithms
0 references
