An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Direct Algorithms for Computing the Transitive Closure of Database Relations
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
PageRank as a function of the damping factor
WWW '05 Proceedings of the 14th international conference on World Wide Web
Substructure similarity search in graph databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
MAVisto: a tool for the exploration of network motifs
Bioinformatics
Closure-Tree: An Index Structure for Graph Queries
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Searching Substructures with Superimposed Distance
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Analysis of protein-protein interaction networks using random walks
Proceedings of the 5th international workshop on Bioinformatics
FANMOD: a tool for fast network motif detection
Bioinformatics
SAGA: a subgraph matching tool for biological graphs
Bioinformatics
Graph embedding in vector spaces by means of prototype selection
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Asymmetric Comparison and Querying of Biological Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
Many emerging database applications entail sophisticated graph-based query manipulation, predominantly evident in large-scale scientific applications. To access the information embedded in graphs, efficient graph matching tools and algorithms have become of prime importance. Although the prohibitively expensive time complexity associated with exact subgraph isomorphism techniques has limited its efficacy in the application domain, approximate yet efficient graph matching techniques have received much attention due to their pragmatic applicability. Since public domain databases are noisy and incomplete in nature, inexact graph matching techniques have proven to be more promising in terms of inferring knowledge from numerous structural data repositories. In this paper, we propose a novel technique called TraM for approximate graph matching that off-loads a significant amount of its processing on to the database making the approach viable for large graphs. Moreover, the vector space embedding of the graphs and efficient filtration of the search space enables computation of approximate graph similarity at a throw-away cost. We annotate nodes of the query graphs by means of their global topological properties and compare them with neighborhood biased segments of the data-graph for proper matches. We have conducted experiments on several real data sets, and have demonstrated the effectiveness and efficiency of the proposed method