Computational Methods in Design Theory

Rudolf Mathon
Additional contact information
Rudolf Mathon: University of Toronto, Department of Computer Science

Chapter Chapter 3 in Computational and Constructive Design Theory, 1996, pp 29-48 from Springer

Abstract: Abstract Enumeration theory, which aims to count the number of distinct (non-equivalent) elements in a given class of combinatorial objects, constitutes a significant area in combinatorial analysis. The object of constructive enumeration consists of creating a complete list of configurations with given properties [5], [8]. There are several reasons which stimulate research in constructive enumeration. Classical methods are not applicable to many interesting classes of objects such as strongly regular graphs, combinatorial designs, error correcting codes, etc. At present, the only available way to count them is by using algorithmic techniques for fixed values of parameters. Lists of objects are important for generating and testing various hypotheses about invariants, characterization, etc. Moreover, examples of designs with given properties are needed in many areas of applied combinatorics such as coding and experiment planning theories, network reliability and cryptography. Algorithms for constructive enumeration frequently require searching in high dimensional spaces and employ sophisticated techniques to identify partial (final) solutions. Such methods may be of independent interest in artificial intelligence, computer vision, neural networks and combinatorial optimization.

Keywords: Local Search; Automorphism Group; Regular Graph; Discrete Math; Design Theory (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-2497-4_3

Ordering information: This item can be ordered from
http://www.springer.com/9781475724974

DOI: 10.1007/978-1-4757-2497-4_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().