Optimal on-line coloring of circular arc graphs
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1995)
- Volume: 29, Issue: 5, page 423-429
- ISSN: 0988-3754
Access Full Article
top
How to cite
topŚlusarek, Maciej. "Optimal on-line coloring of circular arc graphs." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 29.5 (1995): 423-429. <http://eudml.org/doc/92516>.
@article{Ślusarek1995,
author = {Ślusarek, Maciej},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {coloring algorithm},
language = {eng},
number = {5},
pages = {423-429},
publisher = {EDP-Sciences},
title = {Optimal on-line coloring of circular arc graphs},
url = {http://eudml.org/doc/92516},
volume = {29},
year = {1995},
}
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
PB - EDP-Sciences
VL - 29
IS - 5
SP - 423
EP - 429
LA - eng
KW - coloring algorithm
UR - http://eudml.org/doc/92516
ER -
References
top- 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. Zbl0675.68041MR984588
- 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. Zbl0499.05058MR578325
- 3. H. A. KIERSTEAD, A polynomial time approximation algorithm for Dynamic Storage Allocation, Discrete Mathematics, 1991, 88, pp. 231-237. Zbl0761.05087MR1108016
- 4. H. A. KIERSTEAD and W. T. TROTTER, An extremal problem in recursive combinatorics, Congressus Numerantium, 1981, 33, pp.143-153. Zbl0489.05001MR681909
- 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. Zbl0755.68112MR1036825
NotesEmbed ?
topYou 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.