Penerapan Pewarnaan Graf Pada Penjadwalan Mata Kuliah Program Studi Matematika UIN Imam Bonjol Padang

N. Hasanah, Raudhatul Jannah, M. Syafii, Lilis Harianti Hasibuan
{"title":"Penerapan Pewarnaan Graf Pada Penjadwalan Mata Kuliah Program Studi Matematika UIN Imam Bonjol Padang","authors":"N. Hasanah, Raudhatul Jannah, M. Syafii, Lilis Harianti Hasibuan","doi":"10.15548/jostech.v2i2.4349","DOIUrl":null,"url":null,"abstract":"A graph is a discrete structure consisting of vertices and edges connecting these vertices. One of the discussions in graph theory is graph coloring. In this research, graph coloring will be applied in making the schedule for the Mathematics study program at UIN Imam Bonjol Padang by assuming the subject as a vertice and the lecturer as an edge. One of the benefits of applying graph coloring in scheduling makes scheduling arrangements easier. The graph coloring algorithm use the Welsh Powell Algorithm. Based on the application of graph coloring with the Welsh Powell Algorithm obtained the lecturer's teaching schedule according to the SKS, time and classroom given.","PeriodicalId":152379,"journal":{"name":"JOSTECH: Journal of Science and Technology","volume":"16 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOSTECH: Journal of Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15548/jostech.v2i2.4349","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A graph is a discrete structure consisting of vertices and edges connecting these vertices. One of the discussions in graph theory is graph coloring. In this research, graph coloring will be applied in making the schedule for the Mathematics study program at UIN Imam Bonjol Padang by assuming the subject as a vertice and the lecturer as an edge. One of the benefits of applying graph coloring in scheduling makes scheduling arrangements easier. The graph coloring algorithm use the Welsh Powell Algorithm. Based on the application of graph coloring with the Welsh Powell Algorithm obtained the lecturer's teaching schedule according to the SKS, time and classroom given.
在数学学习计划中应用知识运用知识
图是由顶点和连接这些顶点的边组成的离散结构。图论中讨论的问题之一是图的着色问题。在本研究中,图着色将被应用于制定在unimam Bonjol Padang数学学习计划的时间表,假设科目是一个顶点,讲师是一个边缘。在调度中应用图形着色的好处之一是使调度安排更容易。图的着色算法使用了Welsh Powell算法。根据给定的SKS、时间和教室,应用Welsh Powell算法的图着色得到了讲师的教学时间表。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书