Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract).
Jirí FialaPetr A. GolovachJan KratochvílPublished in: ICALP (1) (2008)
Keyphrases
- extended abstract
- computational complexity
- tree edit distance
- low complexity
- high computational complexity
- computational cost
- np complete
- active learning
- motion estimation
- image segmentation
- special case
- distance measure
- euclidean distance
- decision problems
- memory requirements
- gain ratio
- distance metric
- ordered labeled trees
- tree models
- computational efficiency
- unsupervised learning
- optimal solution