Un algorithme efficace recherchant l'isomorphisme de 2 graphes
- Volume: 5, Issue: R3, page 39-51
- ISSN: 0764-583X
Access Full Article
top
How to cite
topSaucier, G.. "Un algorithme efficace recherchant l'isomorphisme de 2 graphes." ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique 5.R3 (1971): 39-51. <http://eudml.org/doc/193185>.
@article{Saucier1971,
author = {Saucier, G.},
journal = {ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique},
language = {fre},
number = {R3},
pages = {39-51},
publisher = {Dunod},
title = {Un algorithme efficace recherchant l'isomorphisme de 2 graphes},
url = {http://eudml.org/doc/193185},
volume = {5},
year = {1971},
}
TY - JOUR
AU - Saucier, G.
TI - Un algorithme efficace recherchant l'isomorphisme de 2 graphes
JO - ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
PY - 1971
PB - Dunod
VL - 5
IS - R3
SP - 39
EP - 51
LA - fre
UR - http://eudml.org/doc/193185
ER -
References
top- [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. Zbl0199.27801MR278977
- [2] G. SAUCIER, Codage des automates asynchrones Thèse de doctorat ès sciences mathématique. Université de Grenoble, 16-11- 1970.
- [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. Zbl0199.27702
- [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. Zbl0123.33710
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.