• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

The hypocoloring problem: complexity and approximability results when the chromatic number is small

Thumbnail
View/Open
hypercoloring.pdf (169.5Kb)
Date
2004
Collection title
Lecture Notes in Computer Science
Collection Id
3353
Dewey
Recherche opérationnelle
Sujet
Algorithms; Approximability; Complexity; Weighted graphs; Subcoloring problem
DOI
http://dx.doi.org/10.1007/978-3-540-30559-0_32
Conference name
30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'04)
Conference date
06-2004
Conference city
Bad Honnef
Conference country
Allemagne
Book title
Graph-Theoretic Concepts in Computer Science 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers
Author
Hromkovic, Juraj; Nagl, Manfred; Westfechtel, Bernhard
Publisher
Springer
Publisher city
Berlin
Year
2004
Pages number
404
ISBN
978-3-540-24132-4
Book URL
http://dx.doi.org/10.1007/b104584
URI
https://basepub.dauphine.fr/handle/123456789/5778
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
de Werra, Dominique
Demange, Marc
Monnot, Jérôme
Paschos, Vangelis
Type
Communication / Conférence
Item number of pages
377-388
Abstract (EN)
We consider a weighted version of the subcoloring problem that we call the hypocoloring problem: given a weighted graph G=(V,E;w) where w(v)S=(S1,¼,Sk)=(S1Sk) of the node set of G into hypostable sets and minimizing max{åv Î Kw(v)| K Î S}maxvKw(v) KS . Properties of hypocolorings are stated; complexity and approximability results are presented in some graph classes. The associated decision problem is shown to be NP-complete for bipartite graphs and triangle-free planar graphs with maximum degree 3. Polynomial algorithms are given for graphs with maximum degree 2 and for trees with maximum degree Delta.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.