Algorithm for finding maximal common subgraph


  • M. B. Ilyashenko


A new enumerating algorithm for the solution of the problem of finding a maximal common subgraph is proposed. The results are presented for the numerical analysis of the algorithm efficiency on graphs of different classes and sizes, which compose the graph database for estimation of the efficiency of algorithms for solving problems concerning morphism on graphs. The potential of using the algorithm in solving real-world problems on graphs sizing up to several hundreds of vertices is estimated.

Author Biography

M. B. Ilyashenko

Ільяшенко Матвій Борисович,

асистент кафедри комп’ютерних систем і мереж Запорізького національного технічного університету, Україна, Запоріжжя





Heuristic methods and algorithms in system analysis and control