Implementation of Sequent Algorithm in Coloring Vertex on Simple Graph
R. Noor, Hasmawati Hasmawati, Hendra Hendra · 2013
Coloring of graph can be done in a three ways, coloring edge, node/vertex, and region. In this paper we used coloring node/vertex and the object is a simple graph. Coloring node/vertex is how to coloring all the node on a graph so that, the two neighboring node/vertex have a different colors. The main purpose of the coloring graph is getting the minimum number of colors to coloring the graph, usuall calledchromatic number. There are several ways to coloring the node/vertex, such as by using the welch-powell algorithm, simulated neural network, and sequent algorithm In this research, the coloring graph used sequent algorithm and for implementation as a program using MATLAB. The asymptotic complexity time of program of sequent algorithm divided in two asymptotic complexity, namely best case and worst case.