221 search results - page 1 / 45 » Twinkle: programming with color |
136
Voted
TEI
2010
ACM
16 years 2 months ago
2010
ACM
206
Voted
WAOA
2004
Springer
16 years 22 days ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
199
Voted
ASP
2003
Springer
16 years 19 days ago
2003
Springer
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
274
click to vote
ICALP
2011
Springer
14 years 11 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
185
click to vote
IMAGING
2003
15 years 8 months ago
2003
An interactive program has been developed to assist in the design of new goniochromatic colors. The program gives the user a unique set of controls over a second order polynomial ...