Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam
Vol 2, No 1 (2015): Wisuda Februari 2015

MEMBANDINGKAN ALGORITMA D’SATUR DENGAN ALGORITMA VERTEX MERGE DALAM PEWARNAAN GRAF TAK BERARAH

Daratun Nasihin (Unknown)
Endang Lily (Unknown)
M. D. H. Gamal (Unknown)

Article Info

Publish Date
15 Dec 2014

Abstract

This article provides an undirected graph vertex coloring. Graph vertex coloring can be done by using the coloring algorithm, including d’satur algorithm and vertex merge algorithm. Of the two algorithms, a more efficient algorithm is determined that generates chromatic number χ(G) which is the minimum or produces fewercolors. This article is a review of the work of Handrizal et. al [Journal of Computer Science 7(5):664-670].

Copyrights © 2015




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam
Website

Abbrev

Publisher

Universitas Riau

Subject

Mathematics

Description

...