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

DOI10.1093/COMJNL/12.4.317MaRDI QIDQ5589132zbMATH OpenOpenAlexFDO

Authors David C. M. Wood

Publication date 1969

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/12.4.317

zbMATH Keywords

topology

Cited in

(9)

• Graph coloring lower bounds from decision diagrams
• Approximation algorithms for combinatorial problems
• Graph coloring with decision diagrams
• Refining the phase transition in combinatorial search
• A language and a program for stating and solving combinatorial problems
• Local optimization of colorings of graphs
• COSINE: A new graph coloring algorithm
• On the chromatic number of graphs
• Grouping products for the optimization of production processes: a case in the steel manufacturing industry

This page was built for publication: A technique for colouring a graph applicable to large scale timetabling problems

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