Graph colouring by maximal evidence edge adding

DOI10.1007/3-540-44629-X_18MaRDI QIDQ2779818zbMATH OpenFDO

Authors Barry Rising, John Shawe-Taylor, Janez Žerovnik

Publication date 15 April 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2079/20790294

zbMATH Keywords

graph colouring, maximal evidence, edge adding, scheduling problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 4187836
• A Pruning Procedure for Exact Graph Coloring
• Graph coloring problems
• A graph coloring algorithm for large scale scheduling problems
• scientific article; zbMATH DE number 1998816

Cited in

(1)

• A grouping genetic algorithm for graph colouring and exam timetabling

This page was built for publication: Graph colouring by maximal evidence edge adding

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