Circular-arc Graph Coloring and Unrolling

Christine Eisenbeis 1 Sylvain Lelait Bruno Marmol
1 A3 - Advanced analysis to code optimization
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France
Abstract : The register periodic allocation problem is viewed as unrolling and coloring the underlying structure of circular-arc graph. The problem is to find relations between the unrolling degree and the chromatic number. For this purpose we distinguish cyclic colorings that can be found by means of the {\em meeting graph} and non-cyclic ones for which we prove the asymptotic property: let $r$ be the width of the original interval family. Then the $u$-unrolled graph is $r$ or $r+1$-colorable for $u$ large enough.
Type de document :
Rapport
RR-3336, INRIA. 1998
Liste complète des métadonnées

https://hal.inria.fr/inria-00073353
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:36:17
Dernière modification le : mercredi 18 octobre 2017 - 13:26:02
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:43:36

Fichiers

Identifiants

  • HAL Id : inria-00073353, version 1

Collections

Citation

Christine Eisenbeis, Sylvain Lelait, Bruno Marmol. Circular-arc Graph Coloring and Unrolling. RR-3336, INRIA. 1998. 〈inria-00073353〉

Partager

Métriques

Consultations de la notice

264

Téléchargements de fichiers

285