Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Journal of Mathematics UNP
Khairani Permata Sari
Unknown Affiliation
Computer Science & IT Decision Sciences, Operations Research & Management Mathematics

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

Found 1 Documents
Search

 1 
Perbandingan Algoritma Pewarnaan LDO, SDO, dan IDO pada Graf Sederhana Khairani Permata Sari; Armiati Armiati; Mirna Mirna
Journal of Mathematics UNP Vol 2, No 1 (2014): Journal Of Mathematics UNP
Publisher : UNIVERSITAS NEGERI PADANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (810.743 KB) | DOI: 10.24036/unpjomath.v2i1.1957

Abstract

Abstract – Vertex colouring is coloring graph vertex such that two neighbor vertexs have different colors. The main purpose of colouring is to get minimum number of colors which is called chromatic number. In the application of graph coloring, which is the minimum number of colors means minimizing the amount of resources such as space and time in solving a problem. To perform the necessary vertex a coloring tool is an algorithm that will govern how the coloring process on a graph. The sequence of the color on a vertex can affect many colors needed to color all vertexs of the graph. There are three algorithms that can be used to perform the coloring vertex by vertex for the election to be colored, the algorithm LDO, SDO, and IDO. After testing in a few simple graphs, it is concluded that none amongst algorithm LDO, SDO, and IDO which always produces the minimum number of colors. Keywords – Vertex colouring, Chromatic number, LDO algorithm, SDO algorithm, IDO algorithm
Co-Authors Purwoko, Agus Solly Aryza