Graph coloring conditions for the existence of solutions to the timetable problem

DOI10.1145/361082.361092MaRDI QIDQ4766587zbMATH OpenOpenAlexFDO

Authors G. A. Neufeld, John Tartar

Publication date 1974

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/361082.361092

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99)

Cited in

(8)

• A multi-stage IP-based heuristic for class timetabling and trainer rostering
• School timetabling for quality student and teacher schedules
• School timetabling problem
• A generalized class-teacher model for some timetabling problems
• Pre-processing techniques for resource allocation in the heterogeneous case
• A graph colouring model for assigning a heterogeneous workforce to a given schedule
• An existential problem of a weight-controlled subset and its application to school timetable construction
• Linear combinations of heuristics for examination timetabling

This page was built for publication: Graph coloring conditions for the existence of solutions to the timetable problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4766587)