A (sub) graph isomorphism algorithm for matching large graphs
We present an algorithm for graph isomorphism and subgraph isomorphism suited for
dealing with large graphs. A first version of the algorithm has been presented in a previous …
dealing with large graphs. A first version of the algorithm has been presented in a previous …
IAM graph database repository for graph based pattern recognition and machine learning
In recent years the use of graph based representation has gained popularity in pattern
recognition and machine learning. As a matter of fact, object representation by means of …
recognition and machine learning. As a matter of fact, object representation by means of …
[PDF][PDF] An improved algorithm for matching large graphs
In this paper an improved version of a graph matching algorithm is presented, which is able
to efficiently solve the graph isomorphism and graph-subgraph isomorphism problems on …
to efficiently solve the graph isomorphism and graph-subgraph isomorphism problems on …
A subgraph isomorphism algorithm and its application to biochemical data
Background Graphs can represent biological networks at the molecular, protein, or species
level. An important query is to find all matches of a pattern graph to a target graph …
level. An important query is to find all matches of a pattern graph to a target graph …
Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3
Graph matching is essential in several fields that use structured information, such as biology,
chemistry, social networks, knowledge management, document analysis and others. Except …
chemistry, social networks, knowledge management, document analysis and others. Except …
[LIVRE][B] Graph classification and clustering based on vector space embedding
This book is concerned with a fundamentally novel approach to graph-based pattern
recognition based on vector space embedding of graphs. It aims at condensing the high …
recognition based on vector space embedding of graphs. It aims at condensing the high …
[PDF][PDF] A performance comparison of five algorithms for graph isomorphism
Despite the significant number of isomorphism algorithms presented in the literature, till now
no efforts have been done for characterizing their performance. Consequently, it is not clear …
no efforts have been done for characterizing their performance. Consequently, it is not clear …
Alldifferent-based filtering for subgraph isomorphism
C Solnon - Artificial Intelligence, 2010 - Elsevier
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern
graph in a target graph. This problem may be solved by a complete tree search combined …
graph in a target graph. This problem may be solved by a complete tree search combined …
Exact and approximate graph matching using random walks
In this paper, we propose a general framework for graph matching which is suitable for
different problems of pattern recognition. The pattern representation we assume is at the …
different problems of pattern recognition. The pattern representation we assume is at the …
A comparison of algorithms for maximum common subgraph on randomly connected graphs
A graph g is called a maximum common subgraph of two graphs, g 1 and g 2, if there exists
no other common subgraph of g 1 and g 2 that has more nodes than g. For the maximum …
no other common subgraph of g 1 and g 2 that has more nodes than g. For the maximum …