TY - GEN

T1 - A genetic approach to the maximum common subgraph problem

AU - Valenti, Cesare Fabio

PY - 2019

Y1 - 2019

N2 - 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

AB - 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

UR - http://hdl.handle.net/10447/375669

UR - https://dl.acm.org/citation.cfm?doid=3345252.3345272

M3 - Conference contribution

SN - 978-1-4503-7149-0

T3 - ACM INTERNATIONAL CONFERENCE PROCEEDINGS SERIES

SP - 98

EP - 104

BT - Proceedings of the 20th International Conference on Computer Systems and Technologies - CompSysTech '19

ER -