Approximate Constrained Bipartite Edge Coloring

Abstract : We study the following Constrained Bipartite Edge Coloring (CBEC) problem: We are given a bipartite graph G(U,V,E) of maximum degree l with n vertices, in which some of the edges have been legally colored with c colors. We wish to complete the coloring of the edges of G minimizing the total number of colors used. The problem has been proved to be NP-hard event for bipartite graphs of maximum degree three.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00371101
Contributor : Hervé Rivano <>
Submitted on : Thursday, March 26, 2009 - 2:53:36 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Document(s) archivé(s) le : Thursday, June 30, 2011 - 11:13:10 AM

File

CFKP_04.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00371101, version 1

Collections

Citation

Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Pino Persiano, et al.. Approximate Constrained Bipartite Edge Coloring. Discrete Applied Mathematics, Elsevier, 2004, 143 (1-3), pp.54--61. ⟨hal-00371101⟩

Share

Metrics

Record views

512

Files downloads

115