Algorithm for Recognizing Cartesian Graph Bundles.
Blaz ZmazekJanez ZerovnikPublished in: Electron. Notes Discret. Math. (1999)
Keyphrases
- experimental evaluation
- learning algorithm
- segmentation algorithm
- computational cost
- detection algorithm
- tree structure
- preprocessing
- times faster
- dynamic programming
- optimization algorithm
- computational complexity
- search space
- significant improvement
- cost function
- np hard
- undirected graph
- maximum flow
- graph based algorithm
- particle swarm optimization
- high accuracy
- probabilistic model
- k means
- optimal solution
- worst case
- matching algorithm
- bayesian networks
- convergence rate
- graph matching
- recognition algorithm
- spanning tree
- image sequences
- shortest path problem
- minimum spanning tree
- social networks
- neural network