A Linear Algorithm to Find the Maximum-weighted Matching in Halin Graphs.
Yunting LuYueping LiDingjun LouPublished in: IMECS (2007)
Keyphrases
- matching algorithm
- computational complexity
- learning algorithm
- preprocessing
- detection algorithm
- computational cost
- particle swarm optimization
- recognition algorithm
- graph matching
- closed form
- dynamic programming
- np hard
- cost function
- objective function
- maximum weight
- string matching
- linear systems
- neural network
- graph model
- graph matching algorithm
- graph mining
- image set
- image matching
- pattern matching
- simulated annealing
- k means