Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam
Daratun Nasihin
Unknown Affiliation
Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
MEMBANDINGKAN ALGORITMA D’SATUR DENGAN ALGORITMA VERTEX MERGE DALAM PEWARNAAN GRAF TAK BERARAH Daratun Nasihin; Endang Lily; M. D. H. Gamal
Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam Vol 2, No 1 (2015): Wisuda Februari 2015
Publisher : Jurnal Online Mahasiswa (JOM) Bidang Matematika dan Ilmu Pengetahuan Alam

Show Abstract | Download Original | Original Source | Check in Google Scholar

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].
Co-Authors Endang Lily M. D. H. Gamal