Simulation-based graph similarity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3920 LNCS, Issue , 2006, Pages 426-440

  Sokolsky, Oleg ^a   Kannan, Sampath ^a   Lee, Insup ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION STOCHASTIC GAMES; LABELED TRANSITION SYSTEMS; POLYNOMIAL-TIME ALGORITHM; SIMULATION-BASED GRAPH;

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; GAME THEORY; INFORMATION ANALYSIS; MARKOV PROCESSES;

COMPUTER GRAPHICS;

EID: 33745770038     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691372_28     Document Type: Conference Paper

References (18)

1. D. Bertsekas. Dynamic Programming: Deterministic and Stochastic Models. Prentice-Hall, Inc., 1987.
2. V. D. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P. Van Dooren. A measure of similarity between graph vertices: Applications to synonym extraction and web searching. SIAM Review, 46(4):64 7-666, 2004.
3. M. C. Browne, E. M. Clarke, and O. Grümberg. Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science, 59(1-2):115-131, 1988.
4. th annual ACM-SIAM Symposium on Discrete Algorithms, pages 121-130, 2004.
5. A. Condon. The complexity of stochastic games. Information and Computation, 96(2):203-224, 1992.
6. st International Colloquium on Automata, Languages, and Programming, volume 3142 of LNCS, pages 97-109, 2004.
7. L. de Alfaro and R. Majumdar. Quantitative solution of omega-regular games. Journal of Computer and System Sciences, 68:374-397, 2004.
8. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labelled Markov processes. Theoretical Computer Science, 318(3):323-354, 2004.
9. J. A. Filar. Ordered field property for stochastic games when the player who controls transitions changes from state to state. Journal of Optimization Theory and Applications, 34:503-515, 1981.
10. th ICDE, 2002.
11. K. Namjoshi. A simple characterization of stuttering bisimulation. In Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 284-296, 1997.
12. S. Needleman and C. Wunsch. 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.
13. A. Papadopoulos and Y. Manolopoulos. Structure-based similarity search with graph histograms. In Proceedings International DEXA Workshop on Similarity Search (IWOSS), Florence, Italy, pages 174-178, 1999.
14. A. Sanfeliu and K. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics, SMC-13(3):353-362, 1983.
15. T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195-197, 1981.
16. P. Szor. The Art of Computer Virus Research and Defense. Addison Wesley Professional, 2005.
17. L. Ungar and T. Sandler, Sept. 2005. Personal communication.
18. Virus source code database, http://www.totallygeek.com/vscdb/.