Kernighan-Lin(KL) algorithm for Partitioning

KL algorithm is an iterative improvement algorithm for bi-partitioning a netlist.Belonging to the class of group migration algorithms, it is based on exchanging a pair of nodes across the partition to reduce the cutset.In this lecture, the algorithm is explained with an example.

[@MdMaksudUlKabirRico]

Wow! This is the best explanation of KL Algorithm on TH-cam. Thank you, brother. It was very helpful.

[@johnreuben6930]

I am glad it helped you!

[@vivek4m]

Simply amazing!! You made it look so easy.

[@moxalshah441]

Excellent work Sir, Thank You so much. It was a great help to me.

[@johnreuben6930]

i have not coded it. You can use a high-level language (like C or MATLAB) and code the steps of KL algorithm

[@xAmiSarahx]

good evening sir...thank you... you helped me for my test

[@anjujoy3976]

very helpful lecture sir☺ do u have the soft copies of the textbooks mentioned?

[@arvindrathore7789]

Crystal clear ,Thanks for this video sir

[@aswinpatel5793]

Very well explained John !! Thanks !!

[@kevinjohnson3622]

Excellent tutorial! Very clear. Thank you.

[@anthonyedwardmaylath7896]

Very clear. Now I can do my homework!

[@rajbhushan3541]

great tutorial

[@zachjackovich116]

Thank you, great explanation!!

[@9788898093]

sir, i am deeply grateful for your help .., here!!!

[@johnreuben6930]

Glad to know that Mani vannan.In which university are you studying?

[@tarekjrd75]

Impressive, Thank you so much !

[@darkprince2703]

TQSM it was very helpful

[@AbhinavKumar-rv9yw]

great lecture!

[@varaprasadgrandhi8101]

Sir can you make the videos for FM algorithm and simulated annealing algorithm.

[@ashishchoudhary9354]

very good lecture! can you please tell me the name of the book from which you have prepared this video.

[@johnreuben6930]

+Ashu Kumar The names of the books i followed are there in the slides themselves..... as footnotes.
Book1: VLSI physical design by Yousuf and Sait,
Book2:VLSI Physical design from Graph Partitioning to timing closure by A.B.Kahng et al
Thank you for watching my video lectures.Hope you find them useful.

[@parthchoudhary0707]

Perfect!!!

[@PEC_SIBASISHMOHANTY]

very nice explanation sir

[@utbhai]

Example starts at minute 23.

[@AditiSinghMVD]

thank you sir .very helpful

[@amjadalruhaimi1032]

is that helpful for TSP ! i need an example for using this algorithm for TSP < thank you ^^

[@johnreuben6930]

TSP- you mean Traveling salesman problem.If so, KL will not help TSP. For TSP, you have to explore a spanning tree or steiner tree algorithm

[@ganeshmula4508]

🙏🙏Thank you sir

[@mykytapavlov2423]

Thank you

[@ravis4025]

NICE REUBEN

[@marat61]

cool!

[@johnreuben6930]

Anju, yes. Contact me at [e-mail]

[@anjujoy3976]

very helpful lecture sir☺ do u have the soft copies of the textbooks mentioned?

[@harryshao189]

Very good lecture!

[@anjujoy3976]

very helpful lecture sir☺ do u have the soft copies of the textbooks mentioned?

[@anjujoy3976]

very helpful lecture sir☺ do u have the soft copies of the textbooks mentioned?

[@anjujoy3976]

very helpful lecture sir☺ do u have the soft copies of the textbooks mentioned?

[@vivek4m]

Ye le: mirror.thelifeofkenneth.com/lib/electronics_archive/VLSI_Physical_Design_From_Graph_Partitioning_to_Timing_Closure.pdf

[@boombeachnoob3642]

@@vivek4m link not working