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

From MaRDI portal

Revision as of 03:48, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5589132

Jump to:navigation, search

DOI10.1093/comjnl/12.4.317zbMath0193.53601OpenAlexW2128553546MaRDI QIDQ5589132

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

Related Items (9)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5589132&oldid=30219761"