10 citations · 10 across the 1 of their papers we have counts for
1 paper
M. A. Fiol, J. Vilaltella
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…