Sur les performances d'algorithmes de recherche de chemins minimaux dans les graphes clairsemés

G. Fontan

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

  • Volume: 8, Issue: V2, page 31-37
  • ISSN: 0399-0559

How to cite

top

Fontan, G.. "Sur les performances d'algorithmes de recherche de chemins minimaux dans les graphes clairsemés." RAIRO - Operations Research - Recherche Opérationnelle 8.V2 (1974): 31-37. <http://eudml.org/doc/104593>.

@article{Fontan1974,
author = {Fontan, G.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
language = {fre},
number = {V2},
pages = {31-37},
publisher = {EDP-Sciences},
title = {Sur les performances d'algorithmes de recherche de chemins minimaux dans les graphes clairsemés},
url = {http://eudml.org/doc/104593},
volume = {8},
year = {1974},
}

TY - JOUR
AU - Fontan, G.
TI - Sur les performances d'algorithmes de recherche de chemins minimaux dans les graphes clairsemés
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1974
PB - EDP-Sciences
VL - 8
IS - V2
SP - 31
EP - 37
LA - fre
UR - http://eudml.org/doc/104593
ER -

References

top
  1. [1] B. ROY, Algèbre moderne et théorie des graphes, Tome II, Dunod, 1970, pp. 127-161. MR260413
  2. [2] S. E. DREYFUS, An Appraisal of some shortest path Algorithm, Operational Research, 1969, 17, n° 3. Zbl0172.44202
  3. [3] G. B. DANTZIG, Linear Programming and extensions, Princeton university Press, pp. 361-366, 1963. Zbl0997.90504MR201189
  4. [4] W. L. PRICE, Graphs an Network An Introduction, Operational Research Series Butterworks, Chapitre III, pp. 46-59. Zbl0258.90046
  5. [5] L. R. FORD Jr et D. R. FULKERSON, Flows in Network, Princeton University Press, pp. 130-134, 1962. Zbl1216.05047MR159700
  6. [6] J. Y. YEN, An algorithm for finding shortest Routes from ail source nodes to a givendestination in General networks, Quaterly of Appl. Maths, 1969, 27, pp. 526-530. Zbl0207.54903MR253822
  7. [7] B. A. CARRÉ, An elimination method for Minimal cost network flow Problem, Large sparse sets of linear equations, J. K. Reid, Academic Press, 1971, pp. 191-209. MR371381
  8. [8] B. A. CARRÉ, An algebra for Network routing problems, J. Inst Maths Applics, 1971; 7, pp. 273-294. Zbl0219.90020MR292583
  9. [9] M. PETITFRÈRE, Sur l'algorithme de Dijkstra pour l'obtention des plus courts cheminsdans un graphe, Cahier du Centre d'Etude de R. O., Vol. 13, n° 3, 1971, pp. 111-123. Zbl0235.90054MR312998
  10. [10] G. FONTAN, Sous programmes de recherche de chemins minimaux dans un graphe, Note Interne L.A.A.S., n° 73 I 14, mai 1973. 
  11. [11] KNUTH, The art of computer programming, vol. 1, Fundamental Algorithm, Addison Wesley, 1972, pp. 228-304. 

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.