APPLICATING CVD ALGORITHM ON EDGE-COLORING OF SPECIAL GRAPHS
Nur Hanifah Insani · ePrints - UNY (Yogyakarta State University) · 2014
Heuristics algorithm is a soultion method that typically relatively quick to find a feasibel soloution with reasonable time and quality though there are no guarantees about if the quality of the solution is bad. This research explores the application of Conflicting Vertex Displacement (CVD) algorithm on edge-coloring of special graphs. This algorithm found by Fiol and Vilaltella [2] 6in 2012 and uses the idea of recolor of two “conflicts” edges (edges that are incident to a vertex) along the paths of adjacent vertices. The research tests the algorithm on special graphs, ie. bipartite graphs.