scientific article; zbMATH DE number 3251135
From MaRDI portal
Publication:5535994
Cited in
(6)- A fast backtrack algorithm for graph isomorphism
- Fifty years of graph matching, network alignment and network comparison
- A comparative analysis of new graph distance measures and graph edit distance
- Properties of graph distance measures by means of discrete inequalities
- Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi
- Graph distance measures based on topological indices revisited
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 Q5535994)