A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph.
Lev B. LevitinMark G. KarpovskyMehmet MustafaLev ZakrevskiPublished in: J. Graph Algorithms Appl. (2006)
Keyphrases
- experimental evaluation
- graph based algorithm
- dynamic programming
- preprocessing
- computational complexity
- high accuracy
- optimal solution
- learning algorithm
- graph structure
- computational cost
- objective function
- cost function
- probabilistic model
- significant improvement
- simulated annealing
- ant colony optimization
- times faster
- k means
- undirected graph
- np hard
- neural network
- np complete
- optimization algorithm
- detection algorithm
- search space