91 search results - page 13 / 19 » combinatorics 2000 |
COMBINATORICS
2000
13 years 9 months ago
2000
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
COMBINATORICS
2000
13 years 9 months ago
2000
We describe a new numerical procedure for generating dense packings of disks and spheres inside various geometric shapes. We believe that in some of the smaller cases, these packi...
COMBINATORICS
2000
13 years 9 months ago
2000
Given a space endowed with symmetry, we define ms(, r) to be the maximum of m such that for any r-coloring of there exists a monochromatic symmetric set of size at least m. We c...
COCOON
2000
Springer
14 years 2 months ago
2000
Springer
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
CPM
2000
Springer
14 years 2 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...