Numerical experiences with graph coloring algorithms
From MaRDI portal
Publication:1070239
DOI10.1016/0377-2217(86)90020-2zbMATH Open0584.05037OpenAlexW2072408982MaRDI QIDQ1070239FDOQ1070239
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
Recommendations
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
- Title not available (Why is that?)
- New methods to color the vertices of a graph
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Title not available (Why is that?)
- On colouring random graphs
- Chromatic Scheduling and the Chromatic Number Problem
- A system for computing university examination timetables
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithm for the Chromatic Number of a Graph
- On Various Algorithms for Estimating the Chromatic Number of a Graph
Cited In (11)
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
- On the recursive largest first algorithm for graph colouring
- New graph coloring algorithms
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Smallest-last ordering and clustering and graph coloring algorithms
- The smallest hard-to-color graph for the SL algorithm
- Using an incomplete version of dynamic backtracking for graph colouring
- Title not available (Why is that?)
- A new efficient RLF-like algorithm for the vertex coloring problem
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)
