Algorithm for recognizing Cartesian graph bundles.
Blaz ZmazekJanez ZerovnikPublished in: Discret. Appl. Math. (2002)
Keyphrases
- graph based algorithm
- dynamic programming
- k means
- detection algorithm
- np hard
- experimental evaluation
- computational complexity
- times faster
- matching algorithm
- worst case
- graph structure
- computational cost
- preprocessing
- probabilistic model
- learning algorithm
- simulated annealing
- expectation maximization
- tree structure
- significant improvement
- similarity measure
- high accuracy
- linear programming
- segmentation algorithm
- cost function
- clustering method
- minimum spanning tree
- image segmentation