Isomorfismo fra grafi: Un algoritmo efficiente per trov are tutti gli isomorfismi
- 1 December 1971
- journal article
- Published by Springer Nature in Calcolo
- Vol. 8 (4) , 301-337
- https://doi.org/10.1007/bf02575800
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970
- Point-symmetric graphs with a prime number of pointsJournal of Combinatorial Theory, 1967
- A Simple and Efficient Algorithm for Determining Isomorphism of Planar Triply Connected GraphsIEEE Transactions on Circuit Theory, 1966
- Search methods used with transistor patent applicationsIEEE Spectrum, 1966
- A Graph-Theoretic Algorithm for Matching Chemical Structures.Journal of Chemical Documentation, 1965
- A document retrieval system for man-machine interactionPublished by Association for Computing Machinery (ACM) ,1964
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphismCommunications of the ACM, 1964
- Some flexible information retrieval systems using structure matching proceduresPublished by Association for Computing Machinery (ACM) ,1964