A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour
Benjamin A. BurtonMelih OzlenPublished in: CoRR (2012)
Keyphrases
- recognition algorithm
- computational complexity
- detection algorithm
- learning algorithm
- improved algorithm
- experimental evaluation
- cost function
- convergence rate
- objective function
- optimization algorithm
- matching algorithm
- search space
- computational cost
- worst case
- simulated annealing
- theoretical analysis
- times faster
- recognition accuracy
- high accuracy
- object recognition
- np hardness
- neural network
- causal graph
- tree structure
- metaheuristic
- clustering method
- segmentation algorithm
- k means