What is timetabling problem?

The University Course Timetabling Problem is a particular type of scheduling problems known as a difficult problem arising in academic institutions, and an application of combinatorial optimization. The problem consists of a coordination of lectures, students, teachers and classrooms to avoid clashes between them.

What are application graph coloring problems?

Graph coloring problem is to assign colors to certain elements of a graph subject to certain constraints. The problem to find chromatic number of a given graph is NP Complete. Applications of Graph Coloring: The graph coloring problem has huge number of applications.

What is chromatic number in graph theory?

The chromatic number of a graph is the smallest number of colors needed to color the vertices of so that no two adjacent vertices share the same color (Skiena 1990, p. 210), i.e., the smallest value of. possible to obtain a k-coloring.

How are graph theory and scheduling problems related?

The first two results are related to coloring graphs belonging to specific classes. In scheduling problems, we are interested in how to efficiently schedule a set of jobs on machines.

How is graph coloring used in timetable scheduling?

Graph coloring is one such heuristic algorithm that can deal timetable scheduling satisfying changing requirements, evolving subject demands and their combinations. This study shows application of graph coloring on multiple data sets of any educational institute where different types of constraints are applied.

What is the purpose of the book Graph Theory?

To our parents Preface This book is intended as an introduction to graph theory. Our aim bas been to present what we consider to be the basic material, together with a wide variety of applications, both to other branches of mathematics and to real-world problems.

How are combinatorial algorithms related to graph theory?

In this dissertation, we present three results related to combinatorial algorithms in graph theory and scheduling, both of which are important subjects in the area of discrete mathematics and theoretical computer science. In graph theory, a graph is a set of vertices and edges, where each edge is a pair of vertices.