6533b7dafe1ef96bd126d85e
RESEARCH PRODUCT
A genetic approach to the maximum common subgraph problem
Cesare Valentisubject
Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniGenetic AlgorithmMaximum Common SubgraphTheoretical computer scienceOptimization problemSettore INF/01 - InformaticaComputer science0102 computer and information sciences02 engineering and technology01 natural sciencesTask (project management)Optimization Problem010201 computation theory & mathematicsSimple (abstract algebra)Genetic algorithm0202 electrical engineering electronic engineering information engineeringElectronic design020201 artificial intelligence & image processingHeuristicsdescription
Finding the maximum common subgraph of a pair of given graphs is a well-known task in theoretical computer science and with considerable practical applications, for example, in the fields of bioinformatics, medicine, chemistry, electronic design and computer vision. This problem is particularly complex and therefore fast heuristics are required to calculate approximate solutions. This article deals with a simple yet effective genetic algorithm that finds quickly a solution, subject to possible geometric constraints.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2019-06-21 | Proceedings of the 20th International Conference on Computer Systems and Technologies |