Hi, is there any graph-edit distance measure or algorithm that doesn't rely on NNs or statistical learning methods? I'm reading A survey of graph edit distance to find some, but getting some advice by someone who is knowledgeable wouldn't be bad
To motivate my interest: I'm trying to determine plagiarism attempts in database schemas through ER or UML diagrams. The typology of database is mostly relational, which means I can also consider SQL source code. The interest in graph-similarity measures arises because one first attempt at addressing the problem comes from considering ER or UML schemas as graphs. However, I'm a mere undergraduate, and I'm not familiar (yet) with anything AI-related
