Nur, Insani (2014) APPLICATING CVD ALGORITHM ON EDGE-COLORING OF SPECIAL GRAPHS. Proceeding of International Conference On Research, Implementation And Education Of Mathematics And Sciences 2014. (Submitted)
|
Text
M-22 Nur Insani.pdf Download (481kB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | edge-coloring, heuristics, Kempe chain, bipartite graphs |
| Subjects: | Prosiding > ICRIEMS 2014 > MATHEMATICS & MATHEMATICS EDUCATION |
| Divisions: | Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Pendidikan Matematika > Matematika |
| Depositing User: | Eprints |
| Date Deposited: | 07 Nov 2014 04:28 |
| Last Modified: | 07 Nov 2014 04:28 |
| URI: | http://eprints.uny.ac.id/id/eprint/11522 |
Actions (login required)
 |
View Item |
