Speaker  ::   Dr. Muraleekrishnan, CSED, NIT Calicut:

Date        ::    1 / 10 / 2009

Topic       ::  This talk was titled Complexity of Algorithms:

A Graph Theoretic Treat-ment and the target audience was III Semester students of IT. The speaker started off with the basic ideas of computational complexity with reference to running time of algorithms and applied the principles to Prim’s algo- rithm and Kruskal’s algorithms for finding the minimal spanning tree of graphs. He also discussed the importance of choosing appropriate datas-tructures for the optimal performance of efficient algorithms.