Abstract
We present symmetric and asymmetric similarity measures for labeled directed rooted graphs that are inspired by the simulation and bisimulation relations on labeled transition systems. Computation of the similarity measures has close connections to discounted Markov decision processes in the asymmetric case and to perfect-information stochastic games in the symmetric case. For the symmetric case, we also give a polynomial-time algorithm that approximates the similarity to any desired precision.
Research has been supported in part by the ONR MURI N00014-04-1-0735 and ARO DAAD19-01-1-0473.
Chapter PDF
Similar content being viewed by others
References
Bertsekas, D.: Dynamic Programming: Deterministic and Stochastic Models. Prentice-Hall, Inc., Englewood Cliffs (1987)
Blondel, V.D., Gajardo, A., Heymans, M., Senellart, P., Van Dooren, P.: A measure of similarity between graph vertices: Applications to synonym extraction and web searching. SIAM Review 46(4), 647–666 (2004)
Browne, M.C., Clarke, E.M., Grümberg, O.: Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science 59(1–2), 115–131 (1988)
Chatterjee, K., Jurdziński, M., Henzinger, T.: Quantitative stochastic parity games. In: SODA 2004: Proceedings of the 15th annual ACM-SIAM Symposium on Discrete Algorithms, pp. 121–130 (2004)
Condon, A.: The complexity of stochastic games. Information and Computation 96(2), 203–224 (1992)
de Alfaro, L., Faella, M., Stoelinga, M.: Linear and branching metrics for quantitative transition systems. In: DÃaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 97–109. Springer, Heidelberg (2004)
de Alfaro, L., Majumdar, R.: Quantitative solution of omega-regular games. Journal of Computer and System Sciences 68, 374–397 (2004)
Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labeled Markov processes. Theoretical Computer Science 318(3), 323–354 (2004)
Filar, J.A.: Ordered field property for stochastic games when the player who controls transitions changes from state to state. Journal of Optiraization Theory and Applications 34, 503–515 (1981)
Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In: Proceedings of 18th ICDE (2002)
Namjoshi, K.: A simple characterization of stuttering bisimulation. In: Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 284–296 (1997)
Needleman, S., Wunsch, C.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48, 443–453 (1970)
Papadopoulos, A., Manolopoulos, Y.: Structure-based similarity search with graph histograms. In: Proceedings International DEXA Workshop on Similarity Search (IWOSS), Florence, Italy, pp. 174–178 (1999)
Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics, SMC 13(3), 353–362 (1983)
Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology 147, 195–197 (1981)
Szor, P.: The Art of Computer Virus Research and Defense. Addison Wesley Professional, Reading (2005)
Ungar, L., Sandler, T.: Personal communication (September 2005)
Virus source code database, http://www.totallygeek.com/vscdb/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sokolsky, O., Kannan, S., Lee, I. (2006). Simulation-Based Graph Similarity. In: Hermanns, H., Palsberg, J. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2006. Lecture Notes in Computer Science, vol 3920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11691372_28
Download citation
DOI: https://doi.org/10.1007/11691372_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33056-1
Online ISBN: 978-3-540-33057-8
eBook Packages: Computer ScienceComputer Science (R0)