Numerical experiences with graph coloring algorithms

DOI10.1016/0377-2217(86)90020-2MaRDI QIDQ1070239zbMATH OpenOpenAlexFDO

Authors 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

computational analysisrandom graphsSequential 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)

Recommendations

• scientific article; zbMATH DE number 3841898
• Some sequential graph colouring algorithms
• scientific article; zbMATH DE number 3906523
• scientific article; zbMATH DE number 4134072
• scientific article; zbMATH DE number 764415

Cites work

• scientific article; zbMATH DE number 3646931 (Why is no real title available?)
• scientific article; zbMATH DE number 3482375 (Why is no real title available?)
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 3404264 (Why is no real title available?)
• A system for computing university examination timetables
• 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
• Chromatic Scheduling and the Chromatic Number Problem
• New methods to color the vertices of a graph
• On Various Algorithms for Estimating the Chromatic Number of a Graph
• On colouring random graphs

Cited in

(11)

• scientific article; zbMATH DE number 3841898 (Why is no real title available?)
• scientific article; zbMATH DE number 3894489 (Why is no real title available?)
• Using an incomplete version of dynamic backtracking for graph colouring
• A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
• scientific article; zbMATH DE number 434500 (Why is no real title available?)
• The smallest hard-to-color graph for the SL algorithm
• A wide-ranging computational comparison of high-performance graph colouring algorithms
• A new efficient RLF-like algorithm for the vertex coloring problem
• On the recursive largest first algorithm for graph colouring
• New graph coloring algorithms
• Smallest-last ordering and clustering and graph coloring algorithms

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

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