A Dynamic Algorithm for Line Graph Recognition.
Daniele Giorgio DegiorgiKlaus SimonPublished in: WG (1995)
Keyphrases
- recognition algorithm
- computational complexity
- k means
- dynamic programming
- clustering method
- graph based algorithm
- learning algorithm
- object recognition
- matching algorithm
- computational cost
- optimization algorithm
- dynamic environments
- objective function
- graph model
- graph theory
- tree structure
- preprocessing
- search space
- cost function
- polynomial time complexity
- optimal solution
- maximum flow
- graph construction
- random graphs
- character recognition
- expectation maximization
- recognition accuracy
- image matching
- np hard
- worst case
- simulated annealing
- detection algorithm
- recognition rate