Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Abstract. We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameteriz...
Lenny Fukshansky, Daniel Moore, R. Andrew Ohana, W...
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of recursive languages (by definition) ...
Abstract--This paper proposes a new algorithm for the reduction of the number of colors in an image. The proposed adaptive color reduction (ACR) technique achieves color reduction ...
Canonical problems are simplified representations of a class of real world problems. They allow researchers to compare algorithms in a standard setting which captures the most im...