Subscribe

Issue No.05 - May (2009 vol.21)

pp: 748-749

Francesco Ranzato , University of Padova, Padova

Lorenzo De Nardo , University of Padova, Padova

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.205

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.

INDEX TERMS

Path and circuit problems, Graphs and networks

CITATION

Francesco Ranzato, Lorenzo De Nardo, "The Subgraph Similarity Problem",

*IEEE Transactions on Knowledge & Data Engineering*, vol.21, no. 5, pp. 748-749, May 2009, doi:10.1109/TKDE.2008.205REFERENCES