Algorithm for finding maximal common subgraph

Authors

  • M. B. Ilyashenko

Abstract

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

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

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

Downloads

Published

2009-06-19

Issue

No. 2 (2009)

Section

Heuristic methods and algorithms in system analysis and control

License

This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles in this journal without asking prior permission from the publisher or the author. This is in accordance with the BOAI definition of open access.