https://github.com/micycle1/rlf-heuristic-for-graph-coloring
C++ Implementations of the RLF heuristic for Graph Coloring
https://github.com/micycle1/rlf-heuristic-for-graph-coloring
algorithm graph-coloring graph-colorizer
Last synced: 8 months ago
JSON representation
C++ Implementations of the RLF heuristic for Graph Coloring
- Host: GitHub
- URL: https://github.com/micycle1/rlf-heuristic-for-graph-coloring
- Owner: micycle1
- Created: 2022-03-23T12:11:12.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2022-03-23T12:41:32.000Z (over 3 years ago)
- Last Synced: 2025-01-18T03:28:48.379Z (9 months ago)
- Topics: algorithm, graph-coloring, graph-colorizer
- Language: C++
- Homepage:
- Size: 20.5 KB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# RLF-heuristic-for-Graph-Coloring
C++ Implementations of the RLF (Recursive Largest First) heuristic for Graph Coloring.
By M. Chiarandini, G. Galbiati, S. Gualandi (2011), from
[Efficiency issues in the RLF heuristic for graph coloring](https://imada.sdu.dk/~marco/Publications/Files/MIC2011-ChiGalGua.pdf).
## RLF Heuristics
* rlf: a simple C++ porting of the PL-1 implementation of RLF given in the original paper.
* rlfPlus: a C++ implementation of RLF that uses array-based list to store the adjacent lists of the graph.
* rlfLazy: a C++ implementation of the Lazy RLF algorithm proposed in the paper.
## Utilities
* generator: generate random uniform graph in the binary graph coloring DIMACS format
* converter: convert binary file format in tex file format