Geodesic
Un algorithme efficace recherchant l'isomorphisme de 2 graphes
ESAIM: Mathematical Modelling and Numerical Analysis , Tome 5 (1971) no. R3, pp. 39-51

Voir la notice de l'article provenant de la source Numdam

@article{M2AN_1971__5_3_39_0,
     author = {Saucier, G.},
     title = {Un algorithme efficace recherchant l'isomorphisme de 2 graphes},
     journal = {ESAIM: Mathematical Modelling and Numerical Analysis },
     pages = {39--51},
     publisher = {Dunod},
     address = {Paris},
     volume = {5},
     number = {R3},
     year = {1971},
     mrnumber = {302510},
     zbl = {0229.05137},
     language = {fr},
     url = {http://geodesic.mathdoc.fr/item/M2AN_1971__5_3_39_0/}
}
TY  - JOUR
AU  - Saucier, G.
TI  - Un algorithme efficace recherchant l'isomorphisme de 2 graphes
JO  - ESAIM: Mathematical Modelling and Numerical Analysis 
PY  - 1971
SP  - 39
EP  - 51
VL  - 5
IS  - R3
PB  - Dunod
PP  - Paris
UR  - http://geodesic.mathdoc.fr/item/M2AN_1971__5_3_39_0/
LA  - fr
ID  - M2AN_1971__5_3_39_0
ER  - 
%0 Journal Article
%A Saucier, G.
%T Un algorithme efficace recherchant l'isomorphisme de 2 graphes
%J ESAIM: Mathematical Modelling and Numerical Analysis 
%D 1971
%P 39-51
%V 5
%N R3
%I Dunod
%C Paris
%U http://geodesic.mathdoc.fr/item/M2AN_1971__5_3_39_0/
%G fr
%F M2AN_1971__5_3_39_0
Saucier, G. Un algorithme efficace recherchant l'isomorphisme de 2 graphes. ESAIM: Mathematical Modelling and Numerical Analysis , Tome 5 (1971) no. R3, pp. 39-51. http://geodesic.mathdoc.fr/item/M2AN_1971__5_3_39_0/