Geodesic
Optimal on-line coloring of circular arc graphs
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 5, pp. 423-429.

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1995__29_5_423_0,
     author = {\'Slusarek, Maciej},
     title = {Optimal on-line coloring of circular arc graphs},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {423--429},
     publisher = {EDP-Sciences},
     volume = {29},
     number = {5},
     year = {1995},
     mrnumber = {1360668},
     zbl = {0838.68090},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1995__29_5_423_0/}
}
TY  - JOUR
AU  - Ślusarek, Maciej
TI  - Optimal on-line coloring of circular arc graphs
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1995
SP  - 423
EP  - 429
VL  - 29
IS  - 5
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1995__29_5_423_0/
LA  - en
ID  - ITA_1995__29_5_423_0
ER  - 
%0 Journal Article
%A Ślusarek, Maciej
%T Optimal on-line coloring of circular arc graphs
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1995
%P 423-429
%V 29
%N 5
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1995__29_5_423_0/
%G en
%F ITA_1995__29_5_423_0
Ślusarek, Maciej. Optimal on-line coloring of circular arc graphs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 5, pp. 423-429. http://geodesic.mathdoc.fr/item/ITA_1995__29_5_423_0/

1. M. Chrobak and M. Ślusarek, On some packing problem related to dynamic storage allocation, RAIRO Theoretical Informatics and Applications, 1988, 22, pp. 487-499. | Zbl | MR | mathdoc-id

2. M. R. Garey, D. S. Johnson, G. L. Miller and C. H. Papadimutriou, The complexity of coloring circular arcs and chords, SIAM J. Alg. Disc. Meth., 1980, 1, pp. 216-227. | Zbl | MR

3. H. A. Kierstead, A polynomial time approximation algorithm for Dynamic Storage Allocation, Discrete Mathematics, 1991, 88, pp. 231-237. | Zbl | MR

4. H. A. Kierstead and W. T. Trotter, An extremal problem in recursive combinatorics, Congressus Numerantium, 1981, 33, pp.143-153. | Zbl | MR

5. M. V. Marathe, H. B. Hunt Iii and S. S. Ravi, Efficient approximation algorithms for Domatic Partition and On-line coloring of Circular Arc Graphs, to appear. Extended abstract in: Proc. Intl. Conf. on Computing and Information ICI'93, Sudbury, May 1993, pp. 26-30.

6. M. Ślusarek, A coloring algorithm for interval graphs, Mathematical Foundations of Computer Science' 89, LNCS 379, pp. 471-480. | Zbl | MR