Feasible node colorings of trees with cardinality constraints - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2006

Feasible node colorings of trees with cardinality constraints

Résumé

Given a tree T with n vertices and three nonnegative integers (n1,n2,n3) such that n1+n2+n3=n, our goal is to find a 3-coloring of T such that each color class i contains ni nodes i=1,2,3. Using a dynamic programming approach we show that this problem can be solved in time O(n5 log n). We also show that our algorithm can be adapted to the case of k-colorings for fixed k.
Fichier non déposé

Dates et versions

hal-01125153 , version 1 (06-03-2015)

Identifiants

  • HAL Id : hal-01125153 , version 1

Citer

Cédric Bentz, Christophe Picouleau. Feasible node colorings of trees with cardinality constraints. [Research Report] CEDRIC-06-987, CEDRIC Lab/CNAM. 2006. ⟨hal-01125153⟩
31 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More