Publication | Open Access
A technique for colouring a graph applicable to large scale timetabling problems
92
Citations
0
References
1969
Year
Mathematical ProgrammingEngineeringComputational ComplexityOperations ResearchSystems EngineeringGraph SuitableGraph DrawingDiscrete MathematicsParallel ComputingCombinatorial OptimizationComputational GeometryLarge ScaleComputer EngineeringCombinatorial ProblemScheduling (Computing)Computer ScienceGraph AlgorithmScheduling AnalysisComputational ScienceGraph TheoryScheduling ProblemParallel ProgrammingSame ColourHeuristic Search
The connection is explained between scheduling problems and colouring the vertices of a graph such that no two adjacent vertices are the same colour, and the minimum number of colours are used. A method of colouring a graph suitable for large scale timetabling problems is described.