![]() ![]() There are but there have been no efficient algorithm known that we could use to solve graph coloring problems. You could research more on it.Īnd yeah you might be wondering whether there any specific algorithms to solve this problem. This is all about graph coloring fundamentals which we need to understand to solve a wide variety of problems in real world. And for above example χ(G)=2 because 2 is minimum number of colors required to color above graph. This solves our problem of scheduling exams so that all students can take exams without worrying about missing one.Īcademically, the least no of colors required to color the graph G is called Chromatic number of the graph denoted by χ(G). Our solution: DAY 1: Algebra and Physics DAY 2: Statistics and Calculus We can conduct exam of courses on same day if they have same color. Second color the graph such that no two adjacent vertices are assigned the same color as shown below: How do we schedule exams in minimum no of days so that courses having common students are not held on same day?įirst draw a graph with courses as vertex and they are connected by edges if they have common students. Problem: Say algebra and statistics exam is held on same day then students taking both courses have to miss at least one exam. And let’s say that following pairs have common students : Let’s suppose algebra, physics, statistics and calculus are four courses of study in our college. Frequency assignment in radio stationsģ.Finding out no of index registers to store variables temporarily during execution of loopīut here, we will be dealing with exam scheduling which is the most interesting one to know about and easy to grasp as well. There are many applications of graph coloring which are really interesting to study about. Now after we have basic understanding of what graph coloring is ,let’s move onto its applications. Ketiga, pewarnaan bidang, yaitu memberikan warna pada bidang sehingga tidak ada bidang yang bertetangga mempunyai warna yang sama. The problem statement is as follows: An undirected graph G is a set of vertices V and a set of edges E. We deal with a special case of graph coloring called ' Vertex Coloring '. You can see them getting connected by edges clearly on the above graph.Īnd the definition of graph coloring is depicted by above graph which says no two adjacent vertices are assigned the same color and none are in the above graph. In general, graph coloring can refer to conditionally labelling any component of a graph such as its vertices or edges. Why ? Because they are connected by edges. And one pair of adjacent vertices are c1 and c3. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |