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...
שמור ב:
| Main Authors: | , |
|---|---|
| פורמט: | Article |
| שפה: | אנגלית |
| יצא לאור: |
Discrete Mathematics & Theoretical Computer Science
2025-02-01
|
| סדרה: | Discrete Mathematics & Theoretical Computer Science |
| נושאים: | |
| גישה מקוונת: | http://dmtcs.episciences.org/14088/pdf |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
היה/י הראשונ/ה לכתוב הערה!