APLIKASI PEWARNAAN GRAF PADA MASALAH PENYUSUNAN JADWAL PERKULIAHAN DI UNIVERSITAS KUNINGAN

Autor:	Mohamad Riyadi, Daswa Daswa
Rok vydání:	2017
Předmět:	Vertex (graph theory) Computer science Programming language ComputingMilieux_COMPUTERSANDEDUCATION Graph coloring computer.software_genre computer Graph Knot (mathematics)
Zdroj:	JES-MAT (Jurnal Edukasi dan Sains Matematika). 3:217
ISSN:	2621-4202 2460-8904
DOI:	10.25134/jes-mat.v3i2.695
Popis:	At the beginning of the semester, the study program must arrange a lecture schedule. Among the problems faced is when there are students who take courses at once in one semester. By identifying the course as a knot, the schedule arrangement can be overcome by dyeing the vertex of the graph, by applying the Welch-Powell algorithm. Graph coloring results are neighboring nodes given different colors. With this method can be determined lecture schedule so that no clashing occurs. And courses that can be done simultaneously, that is, the node with the same color.Keywords: Lecture Schedule, Graf Staining, Welch-Powell Algorithm
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::8e62f256b2998bd3f4e10de69b8383cf https://doi.org/10.25134/jes-mat.v3i2.695 Zobrazit plný text záznamu