221 search results - page 2 / 45 » Twinkle: programming with color |
DAM
2006
13 years 5 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
CAE
2007
13 years 7 months ago
2007
This paper proposes two simple and powerful algorithms to automatically paint Celtic knots with aesthetic colors. The shape of the knot is generated from its dual graph as present...
PLDI
1997
ACM
13 years 9 months ago
1997
ACM
PLDI
1989
ACM
13 years 9 months ago
1989
ACM