5052 search results - page 2 / 1011 » On the Complexity of Ordered Colorings |
ESA
2006
Springer
13 years 9 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
DEXAW
1999
IEEE
13 years 10 months ago
1999
IEEE
A robust method for the localization of frames within document images is presented. It aims at detecting regions delimited by closed polygonal lines or edges in complex color, gra...
SCHOLARPEDIA
2011
12 years 8 months ago
2011
: In 1613 d’Aguilon published a book on optics containing a novel color mixture diagram in arc form. Diagrams of similar form are found in many medieval manuscripts where they ha...
COCOA
2010
Springer
13 years 3 months ago
2010
Springer
A simplex spanned by a colored point set in Euclidean d-space is colorful if all vertices have distinct colors. The union of all full-dimensional colorful simplices spanned by a c...
JETAI
2007
13 years 5 months ago
2007
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...