An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs.
Amr ElmasryKurt MehlhornJens M. SchmidtPublished in: Algorithmica (2012)
Keyphrases
- learning algorithm
- experimental evaluation
- segmentation algorithm
- simulated annealing
- preprocessing
- computational complexity
- tree structure
- computational cost
- times faster
- objective function
- combinatorial optimization
- detection algorithm
- convergence rate
- theoretical analysis
- image sequences
- high accuracy
- significant improvement
- k means
- graph matching
- graph isomorphism
- genetic algorithm
- graph theory
- graph structure
- improved algorithm
- matching algorithm
- shortest path
- optimization algorithm
- linear programming
- cost function
- search space
- similarity measure
- decision trees