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
Valenti C. (2019). A genetic approach to the maximum common subgraph problem. In T. Vassilev, A. Smrikarov (a cura di), Proceedings of the 20th International Conference on Computer Systems and Technologies - CompSysTech '19 (pp. 98-104). New York : Association for Computing Machinery [10.1145/3345252.3345272].
A genetic approach to the maximum common subgraph problem
Valenti C.
2019-01-01
Abstract
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
| File | Dimensione | Formato | |
|---|---|---|---|
|
A genetic approach to the maximum common subgraph problem.pdf
Solo gestori archvio
Tipologia:
Versione Editoriale
Dimensione
1.22 MB
Formato
Adobe PDF
|
1.22 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
