Free Access
Issue |
RAIRO-Oper. Res.
Volume 15, Number 1, 1981
|
|
---|---|---|
Page(s) | 73 - 83 | |
DOI | https://doi.org/10.1051/ro/1981150100731 | |
Published online | 09 February 2017 |
- J. P. BENZECRI, L'analyse des données, Dunod, Paris, t. 1, 1973. [Zbl: 0503.62003] [Google Scholar]
- D. BRELAZ, New Methods to Color the Vertices of a Graph, Comm. A.C.M., vol. 22, n° 4, 1979, p. 251-256. [MR: 527126] [Zbl: 0394.05022] [Google Scholar]
- N. CHRISTOFIDES, Graph Theory; an Algorithmic Approach, Londres, Academic Press, 1975. [MR: 429612] [Zbl: 0321.94011] [Google Scholar]
- D. G. CORNEIL et B. GRAHAM, An Algorithm for Determining the Chromatic Number of a Graph, S.I.A.M. J. Comput., vol. 2, n° 4, 1973, p. 311-318. [MR: 495150] [Zbl: 0282.05104] [Google Scholar]
- A. DEFRENNE, The time tabling Problem: a Survey, Cahiers Centre d'études de Recherche opérationnelle, Bruxelles, vol. 20, n° 2, 1978, p. 163-169. [MR: 503688] [Zbl: 0392.90036] [Google Scholar]
- P. HANSEN et M. DELATTRE, Complete-Link Cluster Analysis by Graph Coloring, J.A.S.A., vol. 73, n° 362, 1978, p. 397-403. [Zbl: 0432.05004] [Google Scholar]
- M. JAMBU, Classification Automatique en Analyse des Données, Dunod, Paris, 1978. [MR: 634958] [Zbl: 0419.62057] [Google Scholar]
- J. L. LAURIÈRE, Un langage et un programme pour énoncer et résoudre des problèmes combinatoires, Thèse d'État, Paris, 1976. [Google Scholar]
- D. W. MATULA, G. MARBLE et J. D. ISAACSON, Graph Coloring Algorithms dans Graph Theory and Computing, New York, Academic Press, 1972, p. 109-122. [MR: 351880] [Zbl: 0256.05108] [Google Scholar]
- J. RANDALL-BROWN, Chromatic Scheduling and the Chromatic Number Problems, Management Science, vol. 19, n° 4, 1972, p. 456-463. [Zbl: 0247.90028] [Google Scholar]
- J. THÉPOT, A propos d'un problème de planning d'examens, Enseignement et Gestion, Paris, vol. 12, 1979, p. 69-74. [Google Scholar]
- J. THÉPOT et G. LECHENAULT, Méthode de Classification pour la Coloration des Graphes, E.I.A.S.M., WP n° 79-29, Bruxelles 1979. [Zbl: 0464.05031] [Google Scholar]
- A. THÉRANI, Un algorithme de coloration, Cahiers du Centre d'Études de Recherche opérationnelle, Bruxelles, vol. 117, n° 2-3-4, 1975, p. 395-398. [MR: 447035] [Google Scholar]
- A. TITLI, et al., Analyse et Commande des Systèmes complexes, monographie A.F.C.E.T., Toulouse, Cepadues éditions, chap. V, 1979. [Zbl: 0463.93004] [Google Scholar]
- C. G. WANG, An Algorithm for the Chromatic Number of a Graph, J.A.C.M., vol. 21, n° 3 , 1974, p. 385-391. [MR: 453577] [Zbl: 0284.05104] [Google Scholar]
- D. DE WERRA, A Note on Graph Coloring, R.A.I.R.O., RI, 1974, p. 49-53. [EuDML: 92005] [MR: 340085] [Zbl: 0279.05105] [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.