To reorient is easier than to orient: An on-line algorithm for reorientation of graphs.
Marta Fiori-CaronesAlberto MarconePublished in: Comput. (2021)
Keyphrases
- learning algorithm
- experimental evaluation
- high accuracy
- graph structure
- times faster
- detection algorithm
- preprocessing
- decision trees
- dynamic programming
- matching algorithm
- computational cost
- optimization algorithm
- simulated annealing
- k means
- improved algorithm
- image matching
- objective function
- theoretical analysis
- particle swarm optimization
- neural network
- worst case
- optimal solution
- np hard
- cost function
- shortest path
- image sequences
- recognition algorithm
- significant improvement
- minimum spanning tree
- graph construction