Generating successive incomplete blocks with each pair of elements in at least one block

A - Papers appearing in refereed journals

Gower, J. C. and Preece, D. A. 1972. Generating successive incomplete blocks with each pair of elements in at least one block. Journal Of Combinatorial Theory Series A. 12 (1), pp. 81-97. https://doi.org/10.1016/0097-3165(72)90085-4

AuthorsGower, J. C. and Preece, D. A.
Abstract

This paper examines solutions to the following combinatorial problem: Produce an ordered set of blocks of M elements chosen from N such that (i) any pair of the N elements occurs together in at least one block, and (ii) the total number of element changes in forming each new block from the previous one is minimised. For certain values of N and M, the only known solutions have no known generalisation. However, several general algorithms are described that produce sets of blocks satisfying (i) and either satisfying or nearly satisfying (ii). Other, related, combinatorial problems are outlined; all are relevant to organizing a certain type of data in a computer.

Year of Publication1972
JournalJournal Of Combinatorial Theory Series A
Journal citation12 (1), pp. 81-97
Digital Object Identifier (DOI)https://doi.org/10.1016/0097-3165(72)90085-4
Open accessPublished as bronze (free) open access
Publisher's version
Copyright license
Publisher copyright
Output statusPublished
Publication dates
Print01 Jan 1972
Online02 Sep 2004
PublisherAcademic Press Inc Elsevier Science
ISSN0097-3165

Permalink - https://repository.rothamsted.ac.uk/item/8wv7q/generating-successive-incomplete-blocks-with-each-pair-of-elements-in-at-least-one-block

56 total views
20 total downloads
0 views this month
0 downloads this month
Download files as zip