Algorithms in Combinatorial Design Theory ( Volume 26 )

Publication series ：Volume 26

Author： Colbourn C. J.;Colbourn M. J.

Publisher： Elsevier Science‎

Publication year： 1985

E-ISBN: 9780080872254

P-ISBN(Paperback): 9780444878021

P-ISBN(Hardback): 9780444878021

Subject： O157.2 combination design

Language： ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

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.

Chapter

Front Cover

pp.： 1 – 4

Algorithms in Combinatorial Design Theory

pp.： 4 – 5

pp.： 5 – 8

Preface

pp.： 6 – 10

Contents

pp.： 8 – 6

Chapter 1. Computation of some parameters of Lie geometries

pp.： 10 – 58

Chapter 2. Performance of subset generating aorithms

pp.： 58 – 68

Chapter 3. The computational complexity of finding subdesigns in combinatorial designs

pp.： 68 – 76

Chapter 4. Algorithmic aspects of combinatorial designs: a survey

pp.： 76 – 146

Chapter 5. Algorithms to find directed packings

pp.： 146 – 152

Chapter 6. Four orthogonal one-factorizations on ten points

pp.： 152 – 160

Chapter 7. A problem of lines and intersections with an application to switching networks

pp.： 160 – 174

Chapter 8. A census of orthogonal Steiner triple systems of order

pp.： 174 – 192

Chapter 9. Derived Steiner triple systems of order 15

pp.： 192 – 218

Chapter 10. A survey of results on the number of t – (v, k, λ) designs

pp.： 218 – 230

Chapter 11. Directing cyclic triple systems

pp.： 230 – 236

Chapter 12. Constructive enumeration of incidence systems

pp.： 236 – 256

Chapter 13. Construction procedures for t-designs and the existence of new simple 6-designs

pp.： 256 – 284

Chapter 14. Tables of parameters of BIBDs with r < 41 including existence, enumeration, and resolvability results

pp.： 284 – 318

Chapter 15. On the existence of strong Kirkman cubes of order 39 and block size 3

pp.： 318 – 330

Chapter 16. Hill-climbing algorithms for the construction of combinatorial designs

pp.： 330 – 348

The users who browse this book also browse