On the on-line coloring of unit interval graphs with proper interval representation

We define the problem as a two-player game between Algorithm and Builder. The game is played in rounds. Each round, Builder presents an interval that is neither contained in nor contains any previously presented interval. Algorithm immediately and irrevocably assigns the interval a color that has no...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Mathematics and Theoretical Computer Science Jg. 27:2; H. Combinatorics; S. 1 - 16
Hauptverfasser:	Curbelo, Israel R., Malko, Hannah R.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Nancy DMTCS 01.08.2025 Discrete Mathematics & Theoretical Computer Science
Schlagworte:	05c15 (primary) 68w27 (secondary) Algorithms Coloring computer science - data structures and algorithms Graph theory Mathematical research mathematics - combinatorics Representations United States
ISSN:	1365-8050, 1462-7264, 1365-8050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!