4171 search results - page 30 / 835 » Choice numbers of graphs |
NIPS
2007
13 years 10 months ago
2007
We propose an active learning algorithm that learns a continuous valuation model from discrete preferences. The algorithm automatically decides what items are best presented to an...
DM
2008
13 years 8 months ago
2008
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
JGT
2010
13 years 7 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
JSYML
2008
13 years 8 months ago
2008
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three...
ICMAS
1998
13 years 10 months ago
1998
abstract, form of this problem, we use a mathematical analysis to show that three different messaging protocols result in varying message loads, depending on certain parameters suc...