A genetic approach to the maximum common subgraph problem

Risultato della ricerca: Conference contribution


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
Lingua originaleEnglish
Titolo della pubblicazione ospiteProceedings of the 20th International Conference on Computer Systems and Technologies - CompSysTech '19
Numero di pagine7
Stato di pubblicazionePublished - 2019

Serie di pubblicazioni


All Science Journal Classification (ASJC) codes

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Fingerprint Entra nei temi di ricerca di 'A genetic approach to the maximum common subgraph problem'. Insieme formano una fingerprint unica.

Cita questo