Unit disk graph recognition is NP-hard.
Heinz BreuDavid G. KirkpatrickPublished in: Comput. Geom. (1998)
Keyphrases
- np hard
- recognition rate
- recognition accuracy
- object recognition
- maximum weight
- computational complexity
- graph structure
- scheduling problem
- linear programming
- graph theory
- feature extraction
- directed graph
- optimal solution
- random walk
- structured data
- visual recognition
- graph model
- bipartite graph
- recognition process
- graph theoretic
- np complete
- special case
- automatic recognition
- approximation algorithms
- handwritten characters
- weighted graph
- integer programming
- image matching
- constraint satisfaction problems
- gesture recognition
- hand gestures
- directed acyclic graph
- spanning tree
- graph representation
- graph matching
- human activities
- greedy heuristic
- human computer interaction
- computationally hard
- pattern recognition
- remains np hard