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

Full description

Bibliographic Details

Published in:	Discrete Mathematics and Theoretical Computer Science Vol. 27:2; no. Combinatorics; pp. 1 - 16
Main Authors:	Curbelo, Israel R., Malko, Hannah R.
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 01.08.2025 Discrete Mathematics & Theoretical Computer Science
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!