Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Diophantine Journal of Mathematics and Its Applications
Pernanda Putra, Hazel
Unknown Affiliation
Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Engineering Industrial & Manufacturing Engineering

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

Found 1 Documents
Search

 1 
Analisis Algoritma Greedy untuk Mewarnai Graf Pernanda Putra, Hazel; Sylviani, Sisilia; Candra Permana, Fahmi
Diophantine Journal of Mathematics and Its Applications Vol. 3 No. 1 (2024)
Publisher : UNIB Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33369/diophantine.v3i1.32261

Abstract

Graph coloring is one of the problems in graph theory. In graph theory, a greedy algorithm is a common algorithms in solving a problem. Greedy algorithms can be used for graph coloring; however, not all of the graph coloring problems that this algorithm uses can optimum outcomes globally. The selection of node sequencing used during the search also affects the success of the greedy algorithm in dealing with graph coloring cases. However, the use of greedy algorithms still helps reduce the number of colors used in non-directed graph coloring.
Co-Authors Candra Permana, Fahmi Sisilia Sylviani