3757 search results - page 75 / 752 » The overlap number of a graph |
ENDM
2008
14 years 10 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
14 years 10 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
15 years 4 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...
ISBRA
2010
Springer
15 years 4 months ago
2010
Springer
d abstract), Nicola Ferraro, Luigi Palopoli, Simona Panni and Simona E. Rombo. Uncovering Hidden Phylogenetic Consensus d abstract), Nicholas Pattengale, Krister Swenson and Bernar...
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...