Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe

I. Lavallée

doi:10.1051/ro/1985190100571

All issues

Volume 19 / No 1 (1985)

RAIRO-Oper. Res., 19 1 (1985) 57-69

References

Free Access

Issue		RAIRO-Oper. Res. Volume 19, Number 1, 1985


Page(s)		57 - 69
DOI		https://doi.org/10.1051/ro/1985190100571
Published online		06 February 2017

1. J. L. BENTLEY, A Parallel Algorithm for Constructing Minimum Spanning Trees, Journal of algorithms vol. 1, 1980, p. 51-59. [MR: 578076] [Zbl: 0435.68049] [Google Scholar]
2. C. BERGE et A. GHOUILA HOURI, Programmes, jeux et réseaux de transport, Dunod, Paris, 1962. [MR: 192912] [Zbl: 0111.17302] [Google Scholar]
3. C. BERGE, Graphes & hypergraphes, Dunod, Paris, 1973, 2e édition. [MR: 898652] [Zbl: 0332.05101] [Google Scholar]
4. Per. BRINCH HANSEN, Distribued Processes=A Concurrent Programming Concept, CACM, vol. 21, n° 11, 1978, p. 934-941. [Zbl: 0393.68028] [Google Scholar]
5. Q. S. F. CARVALHO et G. ROUCAIROL, Une amélioration de l'algorithme d'exclusion mutuelle de Ricart et Agrawala, L.I.T.P. Internal Report n° 81-58, novembre 1981. [Google Scholar]
6. Q. S. F. CARVALHO et G. ROUCAIROL, On Mutual Exclusion in Computer Networks, Technical correspondance, CACM, vol. 26, n° 2, février 1983. [Google Scholar]
7. R. FAURE, Précis de Recherche Opérationnelle, Dunod, Paris, 1979. [Google Scholar]
8. I. LAVALLÉE, Notes sur le parallélisme, C.N.R.S.-G.R. Claude François Picard, Tour 45, 4, place Jussieu, 75230 Paris Cedex 05, 1983. [Google Scholar]
9. I. LAVALLÉE, "An efficient parallel algorithm for Computing a minimal spanning tree", Parallel Computing 83, Elsevier Science Publishers, B.V. (North-Holland) pp. 259-262, 1984. [MR: 809404] [Google Scholar]
10. F. MAFFIOLI, Complexity of Optimum Undirected Tree Problems, Analysis and Design of Algorithms in Combinatorial Optimization, G. AUSIELLO et M. LUCERTINI éd., Springer-Verlag, 1981. [Google Scholar]
11. R. C. PRIM, Shortest Connections Networks and Some Generalizations, Bell System Tech. J., vol. 36, 1957, p. 1389-1401. [Google Scholar]
12. C. SAVAGE et J. J JA'JA, Fast, Efficient Parallel Algorithms for Some Graph Problems, S.I.A.M. J. on Computing, vol. 10, n° 4, novembre 1981, p. 682-691. [MR: 635426] [Zbl: 0476.68036] [Google Scholar]
13. M. SOLLIN, Exposé du Séminaire de C. Berge, I.H.P., 1961; repris in extenso dans Méthodes et modèles de la R.O. », t. 2, p. 33-45, A. KAUFMANN éd., Dunod, Paris, 1968. [Google Scholar]
14. D. STOTT PERKER et B. SAMADI, Distributed Minimal Spanning Tree Algorithms, Performances of data communication System and their applications, G. PUJOLLE éd., North Holland Publishing Company, 1981, p. 46-53. [Google Scholar]
15. G. RICART et A. AGRAWALA, An Optimal Algorithm for Mutual Exclusion in Computer Networks, Comm. A.C.M. 24.1, janvier 1981, p. 9-17. On trouvera une bibliographie très complète dans [14]. [MR: 600729] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.