An efficient transitive closure algorithm for cyclic digraphs
Information Processing Letters
Syntactic clustering of the Web
Selected papers from the sixth international conference on World Wide Web
Mirror, mirror on the Web: a study of host pairs with replicated content
WWW '99 Proceedings of the eighth international conference on World Wide Web
Finding replicated Web collections
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A comparison of techniques to find mirrored hosts on the WWW
Journal of the American Society for Information Science
Approximation algorithms
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
Introduction to Algorithms
On the Approximability of the Maximum Common Subgraph Problem
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
A bag of paths model for measuring structural similarity in Web documents
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Substructure similarity search in graph databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
eMailSift: Email Classification Based on Structure and Content
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
GPLAG: detection of software plagiarism by program dependence graph analysis
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Fragment-based approximate retrieval in highly heterogeneous XML collections
Data & Knowledge Engineering
Information preserving XML schema embedding
ACM Transactions on Database Systems (TODS)
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
TALE: A Tool for Approximate Large Graph Matching
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Neighborhood based fast graph search in large networks
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Graph pattern matching revised for social network analysis
Proceedings of the 15th International Conference on Database Theory
Structure-conforming XML document transformation based on graph homomorphism
Proceedings of the 2012 ACM symposium on Document engineering
Efficient algorithms for generalized subgraph query processing
Proceedings of the 21st ACM international conference on Information and knowledge management
NeMa: fast graph search with label similarity
Proceedings of the VLDB Endowment
I/O efficient: computing SCCs in massive graphs
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Maximizing acceptance probability for active friending in online social networks
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
Strong simulation: Capturing topology in graph pattern matching
ACM Transactions on Database Systems (TODS)
Querying Regular Graph Patterns
Journal of the ACM (JACM)
Hi-index | 0.00 |
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing the structural similarity in these applications. This paper studies revisions of these notions, providing a full treatment from complexity to algorithms. (1) We propose p-homomorphism (p-hom) and 1-1 p-hom, which extend graph homomorphism and subgraph isomorphism, respectively, by mapping edges from one graph to paths in another, and by measuring the similarity of nodes. (2) We introduce metrics to measure graph similarity, and several optimization problems for p-hom and 1-1 p-hom. (3) We show that the decision problems for p-hom and 1-1 p-hom are NP-complete even for DAGs, and that the optimization problems are approximation-hard. (4) Nevertheless, we provide approximation algorithms with provable guarantees on match quality. We experimentally verify the effectiveness of the revised notions and the efficiency of our algorithms in Web site matching, using real-life and synthetic data.