60 search results - page 7 / 12 » combinatorics 1998 |
COMBINATORICS
1998
13 years 6 months ago
1998
Let α and β be a partition of {1, . . . , n} into two blocks. A merging network is a network of comparators which allows as input arbitrary real numbers and has the property tha...
COMBINATORICS
1998
13 years 6 months ago
1998
Let F(n) be a family of partitions of n and let F(n d) denote the set of partitions in F(n) with Durfee square of size d. We de ne the Durfee polynomial of F(n) to be the polynomi...
DCC
1998
IEEE
13 years 6 months ago
1998
IEEE
We discuss some methods for the enumeration, construction and random generation of isometry classes of block codes using methods from algebraic combinatorics.
COMBINATORICS
1999
13 years 6 months ago
1999
![A [k, k+1]-Factor Containing A Given Hamiltonian Cycle](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/a_k_k_1_factor_containing_a_given_hamiltonian_cycle_COMBINATORICS_1999.jpg "A [k, k+1]-Factor Containing A Given Hamiltonian Cycle")
We prove the following best possible result. Let k 2 be an integer and G be a graph of order n with minimum degree at least k. Assume n 8k - 16 for even n and n 6k-13 for odd n...
COCOON
1998
Springer
13 years 11 months ago
1998
Springer
Indexing schemes for grids based on space- lling curves (e.g., Hilbert indexings) nd applications in numerous elds. Hilbert curves yield the most simple and popular scheme. We exte...