Un algorithme pour l'obtention d'une chaîne Hamiltonienne en partant de l'arbre minimal d'un graphe

Ioan Tomescu

RAIRO - Operations Research - Recherche Opérationnelle (1975)

  • Volume: 9, Issue: V3, page 5-12
  • ISSN: 0399-0559

How to cite

top

Tomescu, Ioan. "Un algorithme pour l'obtention d'une chaîne Hamiltonienne en partant de l'arbre minimal d'un graphe." RAIRO - Operations Research - Recherche Opérationnelle 9.V3 (1975): 5-12. <http://eudml.org/doc/104625>.

@article{Tomescu1975,
author = {Tomescu, Ioan},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
language = {fre},
number = {V3},
pages = {5-12},
publisher = {EDP-Sciences},
title = {Un algorithme pour l'obtention d'une chaîne Hamiltonienne en partant de l'arbre minimal d'un graphe},
url = {http://eudml.org/doc/104625},
volume = {9},
year = {1975},
}

TY - JOUR
AU - Tomescu, Ioan
TI - Un algorithme pour l'obtention d'une chaîne Hamiltonienne en partant de l'arbre minimal d'un graphe
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1975
PB - EDP-Sciences
VL - 9
IS - V3
SP - 5
EP - 12
LA - fre
UR - http://eudml.org/doc/104625
ER -

References

top
  1. [1] N. CHRISTOFIDES, The shortest Hamiltonian chain of a graphe, S.I.A.M. J. Appl. Math., 19, 1970, p. 689-696. Zbl0214.23403MR274332
  2. [2] A. KAUFMANN, Introduction à la combinatorique en vue des applications, Dunod, Paris, 1968. Zbl0169.01801MR373909
  3. [3] T. B. BOFFEY, A note on minimal length Hamilton path and circuit algorithms, Oper. Res. Quart., 24, n° 3, 1973, p. 437-439. Zbl0269.90050MR334911
  4. [4] B. ROY, Transitivité et connexité, C.R. Acad. Sc., Paris, série A, 249, 1959, p. 216-218. Zbl0092.15902MR109792
  5. [5] I. TOMESCU, Sur l'algorithme matriciel de B. Roy, R.A.I.R.O., 2, n° 7, 1968, p. 87-91. Zbl0179.29302MR232718

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.