Abstract
In this paper we present a fast algorithm for the computation of error-correcting graph isomorphisms. The new algorithm is an extension of a method for exact subgraph isomorphism detection from an input graph to a set of a priori known model graphs, which was previously developed by the authors.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Messmer, B. T., & Bunke, H. (1997). Fast error-correcting graph isomorphism based on model precompilation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1310, pp. 693–700). Springer Verlag. https://doi.org/10.1007/3-540-63507-6_262
Readers over time
Readers' Seniority
Readers' Discipline
