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

DOI10.1093/COMJNL/12.4.317zbMATH Open0193.53601OpenAlexW2128553546MaRDI QIDQ5589132FDOQ5589132

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)

• Approximation algorithms for combinatorial problems
• Graph coloring with decision diagrams
• Refining the phase transition in combinatorial search
• Local optimization of colorings of graphs
• A language and a program for stating and solving combinatorial problems
• Graph Coloring Lower Bounds from Decision Diagrams
• 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)