scientific article; zbMATH DE number 3639162

MaRDI QIDQ4198074zbMATH OpenFDO

Authors Dieter Gernert

Publication date 1979

zbMATH Keywords

approximate numerical computationclassificationcomplexity measuredistancegraph grammarsinformation retrievallabelled graphspattern recognition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99) Pattern recognition, speech recognition (68T10) Artificial intelligence (68T99) Symbolic computation and algebraic computation (68W30)

Cited in

(3)

• A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
• Fifty years of graph matching, network alignment and network comparison
• Comparing large graphs efficiently by margins of feature vectors

This page was built for publication:

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