3211 search results - page 51 / 643 » On the Grundy Number of a Graph |
ASPDAC
1995
ACM
13 years 11 months ago
1995
ACM
--In this paper, a region definition and ordering assignment (RDAOA) algorithm on minimizing the number of switchboxes is proposed. The time complexity of the algorithm is proved t...
DM
2006
13 years 7 months ago
2006
This paper shows that the number of sign patterns of totally non-zero symmetric n-by-n matrices, up to conjugation by monomial matrices and negation, is equal to the number of unl...
ENDM
2008
13 years 7 months ago
2008
In this note we report on our recent work, still in progress, regarding Folkman numbers. Let f(2, 3, 4) denote the smallest integer n such that there exists a K4
DM
2008
13 years 7 months ago
2008
In this paper, the total chromatic number and fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional ...
CISS
2008
IEEE
2008
IEEE
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
14 years 2 months ago
— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...