The Subgraph Similarity Problem

Authors:
Lorenzo De Nardo;Francesco Ranzato;Francesco Tapparo
Affiliations:
University of Padova, Padova;University of Padova, Padova;University of Padova, Padova
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
2009

Citing 0
Cited 4

Graph pattern matching: from intractable to polynomial time

Proceedings of the VLDB Endowment
A log-linear approach to mining significant graph-relational patterns

Data & Knowledge Engineering
Graph pattern matching revised for social network analysis

Proceedings of the 15th International Conference on Database Theory
Incremental graph pattern matching

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Similarity is a well known weakening of bisimilarity where one system is required to simulate the other and vice versa. It has been shown that the subgraph bisimilarity problem, a variation of the subgraph isomorphism problem where isomorphism is weakened to bisimilarity, is NP-complete. We show that the subgraph similarity problem and some related variations thereof still remain NP-complete.