44 search results - page 8 / 9 » endm 2007 |
ENDM
2010
13 years 8 months ago
2010
Trading decisions in financial markets can be supported by the use of online algorithms. We evaluate the empirical performance of a threat-based online algorithm and compare it to...
ENDM
2007
13 years 8 months ago
2007
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...
ENDM
2007
13 years 8 months ago
2007
Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a b...
ENDM
2007
13 years 8 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
ENDM
2007
13 years 8 months ago
2007
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...