Weighted Coloring: Further Complexity and Approximability Results

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/11560586_17 ◽

2005 ◽

pp. 205-214 ◽

Cited By ~ 1

Author(s):

Bruno Escoffier ◽

Jérôme Monnot ◽

Vangelis Th. Paschos

Download Full-text