Abstract
A quick browse through the Handbook of Combinatorics [217] or The CRC Handbook of Combinatorial Designs [116] indicates that, perhaps more than any other discipline in contemporary mathematics, combinatorics is characterized by the fact that the objects of interest can be represented in a large number of different but nevertheless equivalent ways. Typically there is no single best representation for a particular object; each representation has its advantages and drawbacks. This is especially true when we are designing a classification algorithm for objects of a given type.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this chapter
Cite this chapter
Kaski, P., Östergård, P.R. (2006). Representations and Isomorphism. In: Classification Algorithms for Codes and Designs. Algorithms and Computation in Mathematics, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28991-7_3
Download citation
DOI: https://doi.org/10.1007/3-540-28991-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28990-6
Online ISBN: 978-3-540-28991-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)