Optimal on-line coloring of circular arc graphs

DOI10.1051/ita/1995290504231zbMath0838.68090OpenAlexW182747812MaRDI QIDQ4858840

Maciej Ślusarek

Publication date: 20 December 1995

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92516

zbMATH Keywords

coloring algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

On-line routing in all-optical networks ⋮ On-line graph coloring of \({\mathbb{P}_5}\)-free graphs ⋮ Selfish Routing and Path Coloring in All-Optical Networks ⋮ On-line chain partitions of orders: a survey ⋮ On-line routing in all-optical networks ⋮ On-line coloring and cliques covering for \(\mathbb K_{s,t}\)-free graphs ⋮ The on-line first-fit algorithm for radio frequency assignment problems.

Cites Work

• A polynomial time approximation algorithm for dynamic storage allocation
• Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
• On some packing problem related to dynamic storage allocation
• The Complexity of Coloring Circular Arcs and Chords
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal on-line coloring of circular arc graphs