A technique for colouring a graph applicable to large scale timetabling problems

David Carrico Wood

93 citations0/0 files storedThe Computer Journal

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Scheduling and Timetabling Solutions Constraint Satisfaction and Optimization Graph Labeling and Dimension Problems

Abstract

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 93 citations exist upstream.

Cited by

1984Examination timetabling by computer 1981The Application of a Graph Coloring Method to an Examination Scheduling Problem 2010A Harmony Search with Multi-pitch Adjusting Rate for the University Course Timetabling 2018Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem

Imported from OpenAlex (CC0) — nothing here is generated.