Some MAX SNP-hard results concerning unordered labeled trees
- 11 March 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 49 (5) , 249-254
- https://doi.org/10.1016/0020-0190(94)90062-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the editing distance between unordered labeled treesInformation Processing Letters, 1992
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Object representation and recognition using mathematical morphology modelJournal of Systems Integration, 1991
- Maximum bounded 3-dimensional matching is MAX SNP-completeInformation Processing Letters, 1991
- Simple Fast Algorithms for the Editing Distance between Trees and Related ProblemsSIAM Journal on Computing, 1989
- Threshold decomposition of gray-scale morphology into binary morphologyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Recognition of Largest Common Structural Fragment among a Variety of Chemical StructuresAnalytical Sciences, 1987