217 search results - page 13 / 44 » A new upper bound on the cyclic chromatic number |
STACS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
d Abstract) Frederic Bihan∗ Joel Gomez† Andrew Niles‡ J. Maurice Rojas§ January 24, 2007 Rojas dedicates this paper to his friend, Professor Tien-Yien Li. Consider real biv...
COMBINATORICS
1999
13 years 7 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
JCT
2007
13 years 7 months ago
2007
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on...
TMI
2010
13 years 5 months ago
2010
Abstract—The pinhole camera in single photon emission computed tomography (SPECT) has an inherent trade-off between resolution and sensitivity. Recent systems overcome this to so...