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...

Celý popis

Podrobná bibliografie

Vydáno v:	Discrete Mathematics and Theoretical Computer Science Ročník 27:2; číslo Combinatorics; s. 1 - 16
Hlavní autoři:	Curbelo, Israel R., Malko, Hannah R.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Nancy DMTCS 01.08.2025 Discrete Mathematics & Theoretical Computer Science
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!