- 333 pages
- English
- PDF
- Available on iOS & Android
eBook - PDF
Algorithms in Combinatorial Design Theory
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
Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
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 use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
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 Mathematics & Discrete Mathematics. We have over one million books available in our catalogue for you to explore.
Information
Table of contents
- Front Cover
- Algorithms in Combinatorial Design Theory
- Copyright Page
- Contents
- Preface
- Chapter 1. Computation of some parameters of Lie geometries
- Chapter 2. Performance of subset generating aorithms
- Chapter 3. The computational complexity of finding subdesigns in combinatorial designs
- Chapter 4. Algorithmic aspects of combinatorial designs: a survey
- Chapter 5. Algorithms to find directed packings
- Chapter 6. Four orthogonal one-factorizations on ten points
- Chapter 7. A problem of lines and intersections with an application to switching networks
- Chapter 8. A census of orthogonal Steiner triple systems of order
- Chapter 9. Derived Steiner triple systems of order 15
- Chapter 10. A survey of results on the number of t – (v, k, λ) designs⤀
- Chapter 11. Directing cyclic triple systems
- Chapter 12. Constructive enumeration of incidence systems
- Chapter 13. Construction procedures for t-designs and the existence of new simple 6-designs
- Chapter 14. Tables of parameters of BIBDs with r < 41 including existence, enumeration, and resolvability results
- Chapter 15. On the existence of strong Kirkman cubes of order 39 and block size 3
- Chapter 16. Hill-climbing algorithms for the construction of combinatorial designs