A comparative study of ant colony optimization and reactive search for graph matching problems
From MaRDI portal
Publication:1742614
DOI10.1007/11730095_20zbMath1401.68293MaRDI QIDQ1742614
Olfa Sammoud, Sébastien Sorlin, Christine Solnon, Khaled Ghédira
Publication date: 12 April 2018
Full work available at URL: https://doi.org/10.1007/11730095_20
68R10: Graph theory (including graph drawing) in computer science
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Using local similarity measures to efficiently address approximate graph matching, Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
