Point Visibility Graph Recognition is NP-Hard.
Bodhayan RoyPublished in: Int. J. Comput. Geom. Appl. (2016)
Keyphrases
- np hard
- recognition accuracy
- recognition rate
- special case
- maximum weight
- object recognition
- worst case
- recognition algorithm
- automatic recognition
- pattern recognition
- optimal solution
- graph theoretic
- linear programming
- random walk
- structured data
- graph structure
- visual recognition
- weighted graph
- graph theory
- activity recognition
- closely related
- action recognition
- integer programming
- preprocessing stage
- np hardness
- minimum cost
- constraint satisfaction problems
- computational complexity
- graph based algorithm
- graph grammars
- feature extraction
- greedy heuristic
- edge weights
- recognition process
- graph model
- graph mining
- gesture recognition
- bipartite graph
- lower bound