Diophantine Journal of Mathematics and Its Applications
Vol. 3 No. 1 (2024)

Analisis Algoritma Greedy untuk Mewarnai Graf

Pernanda Putra, Hazel (Unknown)
Sylviani, Sisilia (Unknown)
Candra Permana, Fahmi (Unknown)

Article Info

Publish Date
30 Jun 2024

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.

Copyrights © 2024




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Diophantine Journal of Mathematics and Its Applications
Website

Abbrev

diophantine

Publisher

Universitas Bengkulu

Subject

Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Engineering Industrial & Manufacturing Engineering

Description

The DJMA is published twice a year in June and December. This journal is managed by the Mathematics Department of Bengkulu University. The scope of this journal includes the fields of: 1. Mathematics 2. Applied Mathematics 3. Statistics 4. Applied Statistics 5. Computer ...