Un metodo euristico per la verifica dell'isomorfismo di due grafi semplici non orientati
- 1 March 1971
- journal article
- Published by Springer Nature in Calcolo
- Vol. 8 (1) , 1-31
- https://doi.org/10.1007/bf02575571
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- A Simple and Efficient Algorithm for Determining Isomorphism of Planar Triply Connected GraphsIEEE Transactions on Circuit Theory, 1966