A simple and fast heuristic algorithm for edge-coloring of graphs
Combinatorics
2012-10-19 v1 Discrete Mathematics
Abstract
A simple but empirically efficient heuristic algorithm for the edge-coloring of graphs is presented. Its basic idea is the displacement of "conflicts" (repeated colors in the edges incident to a vertex) along paths of adjacent vertices whose incident edges are recolored by swapping alternating colors (that is, doing a Kempe interchange). The results of performance tests on random cubic and -regular graphs are presented, and a full implementation of the algorithm is given to facilitate its use and the reproducibility of results.
Keywords
Cite
@article{arxiv.1210.5176,
title = {A simple and fast heuristic algorithm for edge-coloring of graphs},
author = {M. A. Fiol and J. Vilaltella},
journal= {arXiv preprint arXiv:1210.5176},
year = {2012}
}