Principe d'un algorithme de recherche d'un isomorphisme entre deux graphes

J. P. Steen

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique (1969)

  • Volume: 3, Issue: R3, page 51-69
  • ISSN: 0764-583X

How to cite

top

Steen, J. P.. "Principe d'un algorithme de recherche d'un isomorphisme entre deux graphes." ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique 3.R3 (1969): 51-69. <http://eudml.org/doc/193128>.

@article{Steen1969,
author = {Steen, J. P.},
journal = {ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique},
keywords = {topology},
language = {fre},
number = {R3},
pages = {51-69},
publisher = {Dunod},
title = {Principe d'un algorithme de recherche d'un isomorphisme entre deux graphes},
url = {http://eudml.org/doc/193128},
volume = {3},
year = {1969},
}

TY - JOUR
AU - Steen, J. P.
TI - Principe d'un algorithme de recherche d'un isomorphisme entre deux graphes
JO - ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
PY - 1969
PB - Dunod
VL - 3
IS - R3
SP - 51
EP - 69
LA - fre
KW - topology
UR - http://eudml.org/doc/193128
ER -

References

top
  1. 1. P. S. ALEXANDROFF, Introduction à la théorie des groupes, Dunod, Paris, 1965. Zbl0175.29501MR179236
  2. 2. C. BERGE, Théorie des graphes et ses applications, Dunod, Paris, 1963. Zbl0121.40101MR155312
  3. 3. A. J. W. DUIJVESTIJN, Electronic Computation of squared rectangles (thèse), Philips Computing Centre, Eindhoven, The Netherlands, 1962. Zbl0102.12301MR144492
  4. 4. W. LEDERMANN, Introduction to the theory of finite groups, Oliver and Boyd, London, 1957. Zbl0041.35901MR54593
  5. 5. O. ORE, Theory of graphs, American Mathematical Society, Colloquium Publi-cations, vol. XXXVIII, 1962. Zbl0105.35401MR150753
  6. 6. J. P. STEEN, Algorithme de recherche d'un isomorphisme entre deux graphes (thèse) Faculté des Sciences de l'Université de Lille, BP 36-59, Lille, France, 1968. 
  7. 7. S. H. UNGER, GIT - A heuristic program for testing pairs of directed line graphs for isomorphism, Com. of ACM, vol. 7, n° 1, janv. 1964, pp. 26 à 34. Zbl0123.33710

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.