The Community for Technology Leaders
RSS Icon
Issue No.05 - May (2009 vol.21)
pp: 748-749
Francesco Ranzato , University of Padova, Padova
Lorenzo De Nardo , 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
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.205
[1] P. Buneman, S. Davidson, M. Fernandez, and D. Suciu, “Adding Structure to Unstructured Data,” Proc. Sixth Int'l Conf. Database Theory (ICDT '97), pp.336-350, 1997.
[2] A. Dovier and C. Piazza, “The Subgraph Bisimulation Problem,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 4, pp. 1055-1056, July/Aug. 2003.
[3] M.R. Henzinger, T.A. Henzinger, and P.W. Kopke, “Computing Simulations on Finite and Infinite Graphs,” Proc. 36th Ann. Symp. Foundations of Computer Science (FOCS '95), pp. 453-462, 1995.
[4] R. Kaushik, P. Shenoy, P. Bohannon, and E. Gudes, “Exploiting Local Similarity for Indexing Paths in Graph-Structured Data,” Proc. 18th Int'l Conf. Data Eng. (ICDE '02), pp. 129-140, 2002.
[5] R. Milner, Communicating and Mobile Systems: The Pi-Calculus. Cambridge Univ. Press, 1999.
[6] T. Milo and D. Suciu, “Index Structures for Path Expressions,” Proc. Seventh Int'l Conf. Database Theory (ICDT '99), LNCS 1540, pp. 277-295, 1999.
[7] R. Paige and R.E. Tarjan, “Three Partition Refinement Algorithms,” SIAM J. Computing, vol. 16, no. 6, pp. 973-989, 1987.
[8] J. Paredaens, P. Peelman, and L. Tanca, “G-Log: A Declarative Graphical Query Language,” IEEE Trans. Knowledge and Data Eng., vol. 7, no. 3, pp.436-453, June 1995.
[9] P. Ramanan, “Covering Indexes for XML Queries: Bisimulation-Simulation = Negation,” Proc. 29th Int'l Conf. Very Large Data Bases (VLDB'03), pp. 165-176, 2003.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool