Finding Isomorph Classes for Combinatorial Structures
Name
MIT-LCS-TM-064.pdf
Size
3.63 MB
Format
Adobe PDF
Checksum (MD5)
a01ed81217fd8e83dfb8fb0c1ec433e2
Author(s)
Weiss, Randell B.
Advisor(s)
Pless, Vera S.
Date Issued
June 1975
Series/Report no.
MIT-LCS-TM-064
MAC-TM-064
Abstract
A common problem in combinatorial analysis is finding isomorph classes of combinatorial objects. This process is sometimes known as isomorph rejection. In graph theory, it is used to count labelled and unlabelled graphs with certain properties. In chemistry, it is used to count the number of structures with the same chemical formula. In computer science it is used in counting arguments in proofs in complexity theory. In coding theory, it is used to partition sets of vectors into easy to handle sets. This thesis presents three different algorithms for solving this type of problem and compares their timing and memory use. Some examples are given of how to apply the algorithms to graph theory and coding theory.
Persistent DSpace Link
