Ant algorithm for the graph matching problem
From MaRDI portal
Recommendations
- A comparative study of ant colony optimization and reactive search for graph matching problems
- An ACO algorithm for the graph coloring problem
- A new algorithm for graph matching with application to content-based image retrieval
- Shape Matching Based on Ant Colony Optimization
- The graph matching problem
Cited in
(7)- A comparative study of ant colony optimization and reactive search for graph matching problems
- An efficient A^* based algorithm for optimal graph matching applied to computer vision
- An algorithm for graph optimal monomorphism
- Shape Matching Based on Ant Colony Optimization
- A new algorithm for graph matching with application to content-based image retrieval
- Isomorphism testing via polynomial-time graph extensions
- Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
This page was built for publication: Ant algorithm for the graph matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5706014)