Some MAX SNP-hard results concerning unordered labeled trees (Q1318750): 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.1016/0020-0190(94)90062-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011975945 / rank | |||
Normal rank | |||
Revision as of 22:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some MAX SNP-hard results concerning unordered labeled trees |
scientific article |
Statements
Some MAX SNP-hard results concerning unordered labeled trees (English)
0 references
5 April 1994
0 references
computational complexity
0 references
comparison between unordered labeled trees
0 references
edit distance
0 references
polynomial time approximation scheme
0 references
