On-line algorithm for the minimal b-clique cover problem in interval graphs
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.
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.
Origine :
Fichiers produits par l'(les) auteur(s)
Loading...