Algorithm for finding maximal common subgraph
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.Downloads
Published
2009-06-19
Issue
Section
Methods, models, and technologies of artificial intelligence in system analysis and control