Algorithms in Combinatorial Design Theory

Front Cover
C.J. Colbourn, M.J. Colbourn
Elsevier, Jan 1, 1985 - Mathematics - 333 pages
0 Reviews
The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs. Algorithmic aspects include generation, isomorphism and analysis techniques - both heuristic methods used in practice, and the computational complexity of these operations. The scope within design theory includes all aspects of block designs, Latin squares and their variants, pairwise balanced designs and projective planes and related geometries.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Chapter 1 Computation of some parameters of Lie geometries
1
Chapter 2 Performance of subset generating aorithms
49
Chapter 3 The computational complexity of finding subdesigns in combinatorial designs
59
a survey
67
Chapter 5 Algorithms to find directed packings
137
Chapter 6 Four orthogonal onefactorizations on ten points
143
Chapter 7 A problem of lines and intersections with an application to switching networks
151
Chapter 8 A census of orthogonal Steiner triple systems of order
165
Chapter 10 A survey of results on the number of t v k λ designs
209
Chapter 11 Directing cyclic triple systems
221
Chapter 12 Constructive enumeration of incidence systems
227
Chapter 13 Construction procedures for tdesigns and the existence of new simple 6designs
247
Chapter 14 Tables of parameters of BIBDs with r 41 including existence enumeration and resolvability results
275
Chapter 15 On the existence of strong Kirkman cubes of order 39 and block size 3
309
Chapter 16 Hillclimbing algorithms for the construction of combinatorial designs
321
Copyright

Chapter 9 Derived Steiner triple systems of order 15
183

Common terms and phrases

Bibliographic information