On the Gotlieb-Csima Time-Tabling Algorithm
M. A. H. Dempster · Canadian Journal of Mathematics · 1968
This paper concerns an algorithm, proposed by C. C. Gotlieb (4) and modified by J. Csima (1;2), for a recent combinatorial problem whose application includes the construction of school time-tables. Theoretically, the problem is related to systems of distinct subset representatives, the construction of Latin arrays, the colouring of graphs, and flows in networks (1;2;3). I t was conjectured by Gotlieb and Csima that if solutions to a given time-table problem existed, i.e. if time-tables incorporating certain pre-assigned meetings existed, their algorithm would find one.