论文信息 - Constructing timetables for sport competitions

Constructing timetables for sport competitions

The purpose of this paper is to present an algorithm for constructing feasible solutions of sport competitions e.g. soccer. After the definition of what is meant by a competition, necessary and sufficient conditions for the existence of a competition is proved with the aid of edge-colouring of complete graphs. Feasible timetables can be found by constructing an oriented edge-colouring.

J. A. M. Schreuder | J. Schreuder

[1] J. N. G. Brittan,et al. College Timetabel Construction by Computer , 1971, Comput. J..

[2] D. de Werra. Construction of School Timetables by Flow Methods. , 1971 .

[3] Shaul P. Ladany,et al. Optimal strategies in sports , 1977 .

[4] D. Werra. Scheduling in Sports , 1981 .

[5] Shaul P. Ladany,et al. Management science in sports , 1978 .

[6] Robin J. Wilson,et al. Edge-colourings of graphs , 1977 .

[7] Frank Harary,et al. Graph Theory , 2016 .

[8] R. J. Aust. An Improvement Algorithm for School Timetabling , 1976, Comput. J..