Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

WG
2004
Springer

favoriteEmaildiscussreport

85views Theoretical Computer Science» more WG 2004»

The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small

13 years 10 months ago

The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small

Download www.lamsade.dauphine.fr

Dominique de Werra, Marc Demange, Jérô

Real-time Traffic

Computer Science | WG 2004 |

claim paper

Related Content

» Bounds on the distribution of the number of gaps when circles and lines are covered by fra...

» Free Bits PCPs and NonApproximability Towards Tight Results

» Free Bits PCPs and NonapproximabilityTowards Tight Results

» The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

» Labeled Traveling Salesman Problems Complexity and approximation

» Counting Stars and Other Small Subgraphs in Sublinear Time

» Extractors for a constant number of polynomially small minentropy independent sources

» Vertex Cover in Graphs with Locally Few Colors

» When Policies Can Be Trusted Analyzing a Criteria to Identify Optimal Policies in MDPs wit...

Post Info
More Details (n/a)

Added	03 Jul 2010
Updated	03 Jul 2010
Type	Conference
Year	2004
Where	WG
Authors	Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos

Comments (0)