Un algorithme efficace recherchant l'isomorphisme de 2 graphes
Open Access
- 1 January 1971
- journal article
- Published by EDP Sciences in Revue française d'informatique et de recherche opérationnelle. Série rouge
- Vol. 5 (R3) , 39-51
- https://doi.org/10.1051/m2an/197105r300391
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphismCommunications of the ACM, 1964