Bhowmik, Biswajit R., <br/><br/>
Design and analysis of algorithms / 
Biswajit R. Bhowmik. 
 - Second edition. 
 - xxxii, 458 pages :  illustrations ;  23 cm. 
<br/><br/>Includes bibliographical references and index. 
<br/><br/>Introduction to algorithms -- Asymptotic notations -- Recursion vs recurrence -- Divide-and-conquer -- Dynamic programming -- Greedy approach -- Backtracking -- Branch and bound -- Lower bound theory -- Disjoint set manipulation -- Graph traversals -- Matrix manipulation algorithms -- Notion of np-completeness -- Approximation algorithms -- Large integers multiplication -- File compression -- Biconnectivity -- Strongly connected components -- Topological sorting -- Dukstra's algorithm. 
<br/><br/><label>ISBN: </label>9789350141359 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms.
<br/><br/><label>Dewey Class. No.: </label>511.8  / B469d