On-line algorithm for the minimal b-clique cover problem in interval graphs - HAL Accéder directement au contenu
Pré-publication, Document de travail Année : 2006

On-line algorithm for the minimal b-clique cover problem in interval graphs

Bernard Kouakou
  • Fonction : Auteur
  • PersonId : 836771

Résumé

In this paper we study the on-line b-clique cover problem in interval graphs. In
our model the n vertices of the final instance-graph are revealed one-by-one, and we want to find a clique cover with the additional requirement that every clique cannot contain more than b vertices, where b is an integer. We first give a result which can be seen as a reduction of the on-line b-clique cover problem into the on-line clique cover problem. Then, we derive
hardness results showing limits of every algorithm solving the on-line b-clique cover problem.
Fichier principal
Vignette du fichier
kouakou_CC.pdf ( 331.73 Ko ) Télécharger
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

halshs-00123607, version 1 (10-01-2007)

Identifiants

  • HAL Id : halshs-00123607 , version 1

Citer

Bernard Kouakou. On-line algorithm for the minimal b-clique cover problem in interval graphs. 2006. ⟨halshs-00123607⟩
112 Consultations
360 Téléchargements
Dernière date de mise à jour le 28/04/2024
comment ces indicateurs sont-ils produits

Partager

Gmail Facebook Twitter LinkedIn Plus