Introduction to algorithms / 
 Algorithms 
Thomas H. Cormen ... [et al.]. 
 - 3rd ed. 
 - Cambridge, Mass. :  MIT Press,  c2009. 
 - xxi, 1180 p. :  ill ;  24 cm. 
<br/><br/> Rev. ed. of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990. 
<br/><br/>
<br/><br/> Both rigorous and complete, this introduction covers traditional material and modern developments: elementary data structures, sorting graph algorithms and NP-completeness are included along with material on Fibonacci heaps, parallel algorithms, network flow algorithms, computational geometry, and number-theoretic algorithms. 
<br/><br/>
<br/><br/><label>ISBN: </label>9780262533058 0262032937 (trade : hc. : alk. paper) 
<br/><br/><label>LCCN: </label>2001031277 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer programming.<br/>Computer algorithms.<br/>Computer programming.<br/>Computer algorithms.
<br/><br/><label>Dewey Class. No.: </label>005.1