Open Access Senior Thesis
Bachelor of Science
Kolmogorov complexity is a theory based on the premise that the complexity of a binary string can be measured by its compressibility; that is, a string’s complexity is the length of the shortest program that produces that string. We explore applications of this measure to graph theory.
Hearn, John, "Kolmogorov Complexity of Graphs" (2006). HMC Senior Theses. 182.