An Algorithm for Detecting Intrinsically Knotted Graphs.
Jonathan MillerRamin NaimiPublished in: Exp. Math. (2014)
Keyphrases
- experimental evaluation
- learning algorithm
- preprocessing
- k means
- minimum spanning tree
- computational complexity
- matching algorithm
- detection algorithm
- theoretical analysis
- particle swarm optimization
- search space
- dynamic programming
- computational cost
- spanning tree
- simulated annealing
- np hard
- recognition algorithm
- significant improvement
- times faster
- improved algorithm
- graph theory
- graph matching
- graph isomorphism
- tree structure
- segmentation algorithm
- computationally efficient
- expectation maximization
- linear programming
- probabilistic model
- image sequences
- decision trees