Sciweavers

221 search results - page 1 / 45
» Twinkle: programming with color
Sort
View
59
Voted
TEI
2010
ACM
125views Hardware» more  TEI 2010»
15 years 4 months ago
Twinkle: programming with color
Jay S. Silver, Eric Rosenbaum
WAOA
2004
Springer
141views Algorithms» more  WAOA 2004»
15 years 3 months ago
Strong Colorings of Hypergraphs
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...
Geir Agnarsson, Magnús M. Halldórsso...
ASP
2003
Springer
15 years 3 months ago
Graphs and colorings for answer set programming: Abridged Report
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...
Kathrin Konczak, Torsten Schaub, Thomas Linke
ICALP
2011
Springer
14 years 1 months ago
Vertex Cover in Graphs with Locally Few Colors
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 ...
Fabian Kuhn, Monaldo Mastrolilli
IMAGING
2003
14 years 11 months ago
Interactive Goniochromatic Color Design
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 ...
Clement Shimizu, Gary W. Meyer, Joseph P. Wingard