scientific article; zbMATH DE number 3251135
From MaRDI portal
Publication:5535994
zbMATH Open0156.18201MaRDI QIDQ5535994FDOQ5535994
Authors: Gerard Salton, E. H. Jun. Sussenguth 
Publication date: 1964
Title of this publication is not available (Why is that?)
Cited In (6)
- Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi
- A fast backtrack algorithm for graph isomorphism
- Fifty years of graph matching, network alignment and network comparison
- Properties of graph distance measures by means of discrete inequalities
- A comparative analysis of new graph distance measures and graph edit distance
- 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)
