Mar 24, 2004 · We propose an improved backtracking algorithm for CSI, which differs from its predecessors by better search strategy and is therefore more efficient.
Mar 24, 2004 · This is achieved by graph matching, a procedure for identifying common subgraphs, or identical subsets of vertices in the compared graphs,.
... In this section, we develop a graph matching algorithm which is based on the backtracking schema. This algorithm is based on the work proposed by Krissinel ...
SUMMARY. Graph theory offers a convenient and highly attractive approach to various tasks of pattern recognition. Provided there is a graph representation ...
We propose an improved backtracking algorithm for CSI, which differs from its predecessors by better search strategy and is therefore more efficient. We found ...
Despite the different models, these three approaches all adopt the backtracking search, which recur- sively extends partial results by mapping query vertices to.
Common subgraph isomorphism detection by backtracking search · E. KrissinelK. Henrick. Computer Science. Softw. Pract. Exp. 2004. TLDR. An improved backtracking ...
Ullmann (1976) describes a recursive backtracking procedure for solving the subgraph isomorphism problem. · Ullmann (2010) is a substantial update to the 1976 ...
In this paper we attempt to parallelize a fast serial subgraph isomorphism library, VFLib, which uses backtracking search to find a solution. Our parallel.
The MCS algorithm described by McGregor [44] employs a simple backtracking search but reduces the number of backtrack instances necessary by inspecting the set ...