Algorithms in Combinatorial Design Theory
eBook - PDF

Algorithms in Combinatorial Design Theory

  1. 333 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Algorithms in Combinatorial Design Theory

Book details
Table of contents
Citations

About This Book

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.

Frequently asked questions

Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Algorithms in Combinatorial Design Theory by C.J. Colbourn,M.J. Colbourn in PDF and/or ePUB format, as well as other popular books in Matemáticas & Matemáticas discretas. We have over one million books available in our catalogue for you to explore.

Information

Publisher
North Holland
Year
1985
ISBN
9780080872254
Topic
Matemáticas
Subtopic
Matemáticas discretas

Table of contents

  1. Front Cover
  2. Algorithms in Combinatorial Design Theory
  3. Copyright Page
  4. Contents
  5. Preface
  6. Chapter 1. Computation of some parameters of Lie geometries
  7. Chapter 2. Performance of subset generating aorithms
  8. Chapter 3. The computational complexity of finding subdesigns in combinatorial designs
  9. Chapter 4. Algorithmic aspects of combinatorial designs: a survey
  10. Chapter 5. Algorithms to find directed packings
  11. Chapter 6. Four orthogonal one-factorizations on ten points
  12. Chapter 7. A problem of lines and intersections with an application to switching networks
  13. Chapter 8. A census of orthogonal Steiner triple systems of order
  14. Chapter 9. Derived Steiner triple systems of order 15
  15. Chapter 10. A survey of results on the number of t – (v, k, λ) designs⤀
  16. Chapter 11. Directing cyclic triple systems
  17. Chapter 12. Constructive enumeration of incidence systems
  18. Chapter 13. Construction procedures for t-designs and the existence of new simple 6-designs
  19. Chapter 14. Tables of parameters of BIBDs with r < 41 including existence, enumeration, and resolvability results
  20. Chapter 15. On the existence of strong Kirkman cubes of order 39 and block size 3
  21. Chapter 16. Hill-climbing algorithms for the construction of combinatorial designs