Budi Rahmadya, Budi R and Narwen, Narwen (2009) Arranging The Examination Schedule by Using Graph Coloring Algorithm. In: The 5-th IMT-GT International Conference on Mathematics, Statistics, and applications, 9-11 Jun 2009, Indonesia.
![[img]](http://repo.unand.ac.id/style/images/fileicons/text.png) |
Text
icmsa unand.pdf Download (5MB) |
Abstract
On of the applications relatrd to graph is the graph coloring. Graph coloring consist of vertices, edges and domain coloring. In this writing, the writer specifically discusses the vertices coloring. The vertices coloring is the application of colors to the vertices of a graph in such a way so that where are no adjacent vetices have similar color. This method can be impelemented in arranging the examination schedule, and then the minimum time in conducting examination can be achieved. Keyword: graph, graph coloring, vertices coloring, vertices, edges.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | A General Works > AC Collections. Series. Collected works |
| Divisions: | Fakultas Matematika dan Ilmu Pengetahuan Alam > Matematika |
| Depositing User: | Ms Novia Leni |
| Date Deposited: | 09 May 2023 03:17 |
| Last Modified: | 09 May 2023 03:26 |
| URI: | http://repo.unand.ac.id/id/eprint/50023 |
Actions (login required)
 |
View Item |
