Tools and Algorithms for the Construction and Analysis of Systems

DOI10.1007/11691372zbMATH Open1180.68198OpenAlexW2739785336MaRDI QIDQ5899072FDOQ5899072

Authors: Oleg Sokolsky, Sampath Kannan, Insup Lee 

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11691372

Recommendations

• scientific article; zbMATH DE number 2089760
• Computing bisimulation-based comparisons
• A similarity measure for graphs with low computational complexity
• Two approaches to determining similarity of two digraphs
• Distance patterns in structural similarity

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (11)

• A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
• A similarity measure for graphs with low computational complexity
• Fifty years of graph matching, network alignment and network comparison
• A graph theoretic approach to simulation and classification
• Limited approximate bisimulations and the corresponding rough approximations
• Title not available (Why is that?)
• Similarity in languages and programs
• Sim2vec: node similarity preserving network embedding
• Inductive Logic Programming
• METRICS FOR FORMAL STRUCTURES, WITH AN APPLICATION TO KRIPKE MODELS AND THEIR DYNAMICS
• Simulation relations for pattern matching in directed graphs

This page was built for publication: Tools and Algorithms for the Construction and Analysis of Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899072)