I like how he actually took the effort to draw the last level.

Someone give this man a medal 🥇 . He is better than the lecturar of expensive private universities. Hats off to you legend 🔥

Loved the last part where you told about the origin of this problem, it was something new and really helped to realize why were we doing this : )

I feel like I'm giving my fees to the wrong teachers, my college should hire teachers like him instead

funny thing is my college teacher is making notes from your videos and still could not teach

The way you gracefully explain the complex problem is just amazing. Thank you for all your hard work. :)

Looking forward to the day when I post on LinkedIn about my journey to my dream company and I attach your channel as a reference for DP, Backtracking, Algos, etc

13:09 Smoothest transition by Abdul Sir so far😅😂. Can't stop going back and checking frame by frame the way sir seems to be in the same place.

brilliant storytelling of the historical case where the graph coloring can be applied!

Your videos are the best sir! Thank you for getting me through my algorithms class. Keep up the good work :)

Your videos have a lot of educational value, thank you so much for sharing. Currently taking Algorithm Design and Analysis

Your videos are a gift to the world! Thank you

In the coloring of the map there must have to connect node 1 to node 4 because these two are adjacent according to this map.

Best CS teacher ever, make every topic bite-able.

Great ! You are a great Teacher. Thanks for saving my Design and analysis of Algorithm Paper. #Respect

Thank you for your great effort and helping students around the world.

sir ,your teaching style is awesome .Really, love your videos

I am a big fan of you, now following everything about algorithms and maths.

Even though NITs and prestigious state government colleges have the worst faculty. Without these teachers, I cannot imagine that I could pass the semester exams.

Thank you sir. 🙂 Your videos are very helpful for papers .

I appreciate your immediate response.

Superb sir....seriously the way you explain and speak is so easy and understandable to any one.....

It would be helpful if you provide some pseudo code with the examples and explain in terms with the code too 😁😁 PS:- your videos are really helpful

What an excellent teacher! I feel like I am back in college! Thank you Abdul for educating us.

itna zyada student seen kr rha ....bhut accha sir,thanku so much sir for ur help

well explained, good camera, thanks

Thank you sir for these types of videos it's really very helpful for us ❤️❤️

For the graph colouring problem at 14:55, should not vertex 4 connect to vertex 1? The boundaries connect

the map printing example was superb professor

good Teacher.Learnt many things.so simple in understanding.

Sir is, Aamir Khan of Algorithms

Your channel is very helpful

@Abdul Bari In university exam, is required to find all possibility of graph coloring ?

Great content as usual-can anyone suggest a good tutorial (novice friendly) for finding the chromatic no of a graph.Does Abdul sir have any videos on this topic in particular?

Please include algorithm sir

even after 100 years , this man will be remembered

Your an life savior of many btech students in jntu

Sir for Network flow and matching lecture video is available or not?

best explanation of backtracking this far

15:25 Since 4 is neighbour to 1 between 2 and 5,there should be an edge from 4 to 1 or 1 to 4 at 15:25, right?

Should we use the same kind of execution technique for mColouringDecisionProblem and mColouringOptimzationProblem? (Of course, we will terminate once a solution is obtained, nut is there a better method?)

Thanks!

sir if we are having only 3 nodes and 3 colors how could we do the problem ??

It's really good sir.

really helpful sir thank you very much

Is there a condition as to whether all the given colours must be used ?

What an explanation sir,,👏👏👏

Sir it is simple graph,how can we do backtracking using tree in complex graph like if there is path between 2 and 4

thanks, wrote the code directly, didn't even need to take any reference or watch it again

Thanks. Very helpful!

voice is so good to understand and skip written part by himself which is not imp thats so better

Thank You So Much Abdul Sir..........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻 as usual super dooper explanation

Thank you , I appreciate your help so much

how about the point that dont connect to any other point? what should i color it? a different color that no point got it? or same as any point color?

Sir.. actually how many solutions can obtain at end of the video is 18 or more that?

Thank you for your great effort

looks little bit like gujarat map, btw nice video appreciate the effort.

is there any rule to start colouring from specific vertex? or we can start colouring from any vertex?? please reply @Abdul Bari

Best teacher I've seen my teacher is not even close to him!!

Can you explain how GCP can be used in College/exam Timetabling

Can you provide lisp programming for the same problem using any search method

Sir the last application part was really awesome and made me reason for learning Can you please add applications to all problems to solve in upcoming videos :)

In exam , how are we going to draw the space tree of such a lengthy problem?Please suggest some ways

Thankyou abdul! great bideo!

Preparing for upcoming google interviews. Solved an unanswered google problem from geeksforgeeks interview experience with m-colouring optimization algorithm. Had start and end time of meetings in 2 different arrays. Had to compute minimum number of rooms that are required to host all meetings. Start = [9:00,9:40,9:50,11:00,15:00,18:00] End = [9:10,12:00,11:20,11:30,19:00,20:00] So I created objects with start and end time and treated them as graph nodes. And added edges between nodes with overlapping timings. And finally solved it using m-colour optimization problem. The answer is 3. 😄

Great video , I am curious not on writing an algorithm for chromatic number but to obtain the chromatic polynomial for the graph. Is there an easy relation one can uses to go from chromatic number to chromatic polynomial for a backtracking algorithm?

Sir time complexity of this problem?

Is there any condition that all colors must be used at every step..?

very conceptual

great job sir.

nice explanation :)

is this also called Constraint Satisfaction problem? CSPs?

Sir, firstly thanx for your videos. In the above example, if we draw tree by taking even GREEN and BLUE in the root node then the tree expands very large so would you suggest how to represent such huge trees in exam?

Hello, how many chromatic number of (c7) power 2 ????

sir how to determine minimum number of color required to color a graph

Thank you algo king Abdul 🙏

Sir, this is working in sequence number means 1,2,3..... Like this Or This is working with the adjacent

Sir it would be much better if you provide algorithms as well because in exams they ask algorithms too.

thank u nice explanation sir

Awesome sir....Thank you....😇😇😇😇

very well explained sir

Can you also do the machine learning algorithm too, and thank you for helping understanding these concept :)

Tommorrow is my exam and i done prepration by your video 🍀🍀

Sir ye 5. Bhi to connect ho rha hai 2 se

can u explain bounding function

Thank u so much sir! really

Sir, you explained the Graph colouring problem as "the number of ways to colour a graph or given a number of colours, find if its possible to colour the graph". Then you explained about the history with Map colouring. In Map colouring problem, we need to find the minimum number of colours to colour the map with same constraints. These are related but different problems. Nevertheless, I feel that in the Graph colouring we can add a small optimisation - if the number of colours needed are more than the number of colours in a previously seen branch, then also we can stop early(bound).

how many of you are watchin 1.5x or 2x hit like here kabi kabhi nhi hamesha lagta hai ki sir ich bhagwan hai.... akash gaytunde

awesome example on application✌

Hello dear sir could you please add video on adding and delete node/ edge in graph

Sir please upload Live variable analysis in compiler design thanks

bài giảng hay lắm ạ, mỗi tội cháu ko nghe thấy gì, may mà có phụ đề tiếng anh.

after trying red on the first vertex,do we need to try out Green and blue on the first vertex in the subsequent iterations.Or will 1st vertex always be colored with red only?

@abdul Bari : can u Plz start including code snippet also in Ur videos? Everytime I need to follow other sites for code.

Great explanation ❤️

Great explanation 🔥

what is the m value for map graph?

Nice superb explanation

@AbdulBari Sir, which book do you recommend reading. I am following "The Algorithm Design Manual". But it does not have many of the concepts I learnt from you. Can you recommend a few. Thanks in advance

will there be a direct path from node 1 to node 4 in Map to graph. Anyone help me in understand.