Issue No. 05 - May (2009 vol. 21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.205
Lorenzo De Nardo , University of Padova, Padova
Francesco Ranzato , University of Padova, Padova
Francesco Tapparo , University of Padova, Padova
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.
Path and circuit problems, Graphs and networks
F. Ranzato, F. Tapparo and L. De Nardo, "The Subgraph Similarity Problem," in IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 748-749, 2008.