On the Computational Complexity of Codes in Graphs.
Jan KratochvílMirko KrivánekPublished in: MFCS (1988)
Keyphrases
- computational complexity
- special case
- np complete
- graph matching
- np hard
- graph theory
- error correction
- computationally efficient
- weighted graph
- decision problems
- structured objects
- graph clustering
- graph theoretic
- graph partitioning
- graph databases
- low complexity
- rate distortion
- clustering algorithm
- directed graph
- database
- computational efficiency
- pattern recognition
- data structure
- similarity measure
- series parallel
- learning algorithm