EFFICIENT COURSE AND EXAM SCHEDULING USING GRAPH COLORING
نویسندگان
چکیده
منابع مشابه
A New Exam Scheduling Algorithm Using Graph Coloring
This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Through the work, we consider few assumptions and constraints, closely related to the general exam scheduling problem, and mainly driven from accumulated experience at various universities. The performance of the algorithm is...
متن کاملScheduling Problems and Generalized Graph Coloring
We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. To this coloring there is an associated symmetric function in noncommuting variables for which we give a deletion-contraction formula. In the case of graphs our symmetric function in noncommuting variables agrees with the chromatic symmetric function in noncommuting variab...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولEffective and Efficient Dynamic Graph Coloring
Graph coloring is a fundamental graph problem that is widely applied in a variety of applications. The aim of graph coloring is to minimize the number of colors used to color the vertices in a graph such that no two incident vertices have the same color. Existing solutions for graph coloring mainly focus on computing a good coloring for a static graph. However, since many real-world graphs are ...
متن کاملGraph Coloring using CUDA
ion of computation For a graph G = (V,E), we denote the number of vertices |V| by n, the number of edges|E| by m, and the degree of a vertex vi by deg(vi). The maximum, minimum, and average degree in a graph are denoted by (delta), (sigma), and (sigma -) respectively. The minimum number of colors required to color a graph is referred to as the Chromatic number. There exists several fast sequent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IJAEDU- International E-Journal of Advances in Education
سال: 2017
ISSN: 2411-1821
DOI: 10.18768/ijaedu.309802