preprint · 2012
A simple and fast heuristic algorithm for edge-coloring of graphs
A simple but empirically efficient heuristic algorithm for the edge-coloring of graphs is presented. Its basic idea is the displacement of "conflicts" (repea...
10 citationsDOI: https://doi.org/10.48550/arxiv.1210.5176Open accessPDF reported by metadata