Free Access
Volume 5, Number R3, 1971
Page(s) 39 - 51
Published online 01 February 2017
  1. D. G. CORNEIL et C. C. OTLIEB, An efficient algorithm for graph isomorphism, J.A.C.M., vol. 17, n° 1, january 1970, pp. 51-64. [MR: 278977] [Zbl: 0199.27801] [Google Scholar]
  2. G. SAUCIER, Codage des automates asynchrones Thèse de doctorat ès sciences mathématique. Université de Grenoble, 16-11- 1970. [Google Scholar]
  3. J. P. STEEN, Algorithme de recherche d'un isomorphisme entre 2 graphes. Thèse 3e cycle Mathématiques Appliquées, Lille, 26-2- 1968. [Zbl: 0199.27702] [Google Scholar]
  4. S. H. UNGER, A heuristic program for testing pairs of directed line graphs for isomorphism. Comm. A.C.M., 7, 1 (janv. 1964), pp. 26-34. [Zbl: 0123.33710] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.

Recommended for you