Graph Coloring Problem using Backtracking || Design and Analysis of Algorithms || DAA || M Coloring

#sudhakaratchala #daavideos #daaplaylist
Let G=(V,E) be a graph, in graph colouring problem, we have to find whether all the vertices of the given graph are coloured or not, with the constraint that no two adjacent vertices have the same colour.
The problem has two versions
1.m-colourability decision problem
2.m-colourability optimization problem

[@muskansha5660]

i actually don't comment on any videos. but i couldn't stop myself from appreciating your way of teaching and the way you cover all the doubts with clear concept. thank you sir..

[@SudhakarAtchala]

So nice of you. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...

[@kaichousan8626]

My university professors can't beat this KIng's way of handling and explaining concepts here.

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@sreelokesheranki8184]

Thank you so much sir. I’m having sem exams 3-2 regular of this subject Design and analysis of algorithms I’m a cse student studying in an affiliated college of JNTUK Andhra Pradesh. I recommended this Channel to my friends for 3-1 semester for OS subject. Thank you so much sir ❤️

[@SudhakarAtchala]

Welcome Lokesh

[@cs_soldier5292]

Thankyou sir, I have recommended this channel to my friends for DAA subject.

[@SudhakarAtchala]

Many many thanks.

[@geethika7626]

Tq so much sir for explaining this topics sir also explain 0/1 knapsack using branch and bound (least cost)

[@SudhakarAtchala]

Ys sure. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@Priyanka-777]

Thank you so much sir I really appreciate your efforts for explaining in a very clear way 😄

[@SudhakarAtchala]

welcome.

[@011deepshahr9]

Best video for this topic on KZbin ❤

[@SudhakarAtchala]

Thanks for your compliment. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@akhilkumarpatnaikvandrangi9195]

Nice Explaination ... Thank you very much sir

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@beautyqueen4513]

tq so much for ur great explanation sir

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@ravitejadarvemula5779]

excellent work sir!

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@adithyavarma758]

thank you very much sir

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@bhargav5611]

Clear explanation sir thank you

[@SudhakarAtchala]

So nice of you

[@pavanicse569]

Thank you soo much sir 😊

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@preethipreethi6065]

Thank you so much sir...😍

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@shanmathi1031]

Nice explanation sir ✨

[@SudhakarAtchala]

Thanks and welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@anvithaki8935]

Hello sir can you please upload 0/1 knapsack problem using dynamic programming

[@SudhakarAtchala]

Ya sure. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@kunalgoswami1243]

Sir can u answer me, i think more then 3 or 4 colorable is NP-complete problem. Is it correct ?

[@SudhakarAtchala]

I don't know about np complete problem

[@kalyansuhaskonumuri3224]

sirrrrrr super sir meruuuuu meee valeeee exams aniii baga rastunawww Thank You sir!

[@SudhakarAtchala]

Congratulations. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@-Babitha]

Thank you ❤️😊

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@SrimanasaGunturu]

Tq so much sir ❤

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@ravitejadarvemula5779]

Please upload 01 knapsack problem sir!

[@SudhakarAtchala]

Ya sure. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@user-ey5tm2pd3x]

Can you explain these same example by taking m=4 colors

[@SudhakarAtchala]

As soon as possible. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...

[@ManiTeluguGamer23]

Sir pls explain 8 queen back tracking problem sir.

[@SudhakarAtchala]

Ok sure. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@DeviGorantla]

Sir do on kanap sack using backtracking

[@SudhakarAtchala]

very soon. if any topics are not uploaded then plz reply. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@LE_MadhukarKota]

Sir exam lo kuda mir chepina process with some explanation of steps rastey saripotadaa leka pseudo code rayala? In DAA exam..answer me Sir

[@SudhakarAtchala]

No need of pseudo code. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..