2432 search results - page 20 / 487 » Degrees and choice numbers |
SIAMCOMP
2002
13 years 7 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
COMBINATORICS
2006
13 years 7 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
MOC
2000
13 years 7 months ago
2000
We develop an efficient technique for computing values at s = 1 of Hecke L-functions. We apply this technique to the computation of relative class numbers of non-abelian CM-fields ...
MOC
2000
13 years 7 months ago
2000
Given an odd prime p we show a way to construct large families of polynomials Pq(x) Q[x], q C, where C is a set of primes of the form q 1 mod p and Pq(x) is the irreducible poly...
SIGIR
2009
ACM
14 years 1 months ago
2009
ACM
In numerous everyday domains, it has been demonstrated that increasing the number of options beyond a handful can lead to paralysis and poor choice and decrease satisfaction with ...