The interval count of interval graphs and orders: a short survey
The interval count problem determines the smallest number of interval lengths needed in order to represent an interval model of a given interval graph or interval order. Despite the large number of studies about interval graphs and interval orders, surprisingly only a few results on the interval cou...
Gespeichert in:
Veröffentlicht in: | Journal of the Brazilian Computer Society 2012-06, Vol.18 (2), p.103-112 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The
interval count problem
determines the smallest number of interval lengths needed in order to represent an interval model of a given interval graph or interval order. Despite the large number of studies about interval graphs and interval orders, surprisingly only a few results on the interval count problem are known. In this work, we provide a short survey about the interval count and related problems. a graph and the number of its maximal cliques. |
---|---|
ISSN: | 0104-6500 1678-4804 |
DOI: | 10.1007/s13173-011-0047-1 |