Numerical experiences with graph coloring algorithms

DOI10.1016/0377-2217(86)90020-2zbMath0584.05037OpenAlexW2072408982MaRDI QIDQ1070239

Jürgen Peemöller

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90020-2

zbMATH Keywords

random graphscomputational analysisSequential vertex colouring algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

• On colouring random graphs
• On Various Algorithms for Estimating the Chromatic Number of a Graph
• New methods to color the vertices of a graph
• An Algorithm for the Chromatic Number of a Graph
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• A system for computing university examination timetables
• Chromatic Scheduling and the Chromatic Number Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Numerical experiences with graph coloring algorithms