Scholarlink

Graph vertex coloring is a classic problem in graph theory with numerous applications in optimization and combinatorics. This paper explores the application of Greedy algorithm for graph vertex coloring in the context of creating optimal class schedules at a university. Greedy algorithm should provide an efficient solution to the scheduling problem, reducing conflicts and optimizing resource utilization. The implementation of the algorithm will be performed in the C++ programming language, with performance analysis on real data sets and testing on real university schedule data.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Application of Graph Coloring to Class Scheduling

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Fatka Kulenović,
  • Šejla Gerzić Jusić,
  • Sanel Gredelj,
  • Husein Rošić

摘要

Graph vertex coloring is a classic problem in graph theory with numerous applications in optimization and combinatorics. This paper explores the application of Greedy algorithm for graph vertex coloring in the context of creating optimal class schedules at a university. Greedy algorithm should provide an efficient solution to the scheduling problem, reducing conflicts and optimizing resource utilization. The implementation of the algorithm will be performed in the C++ programming language, with performance analysis on real data sets and testing on real university schedule data.