| 000 | 01093nam a22002657i 4500 | ||
|---|---|---|---|
| 008 | 230724s2009 |||ado|| |||| 001 0 eng d | ||
| 020 |
_a9780262533058 _qpbk. |
||
| 040 | _aGCL | ||
| 082 |
_a005.1 _bCOR |
||
| 100 | 1 | _aCormen, Thomas H. | |
| 245 | 1 |
_aIntroduction to algorithms / _cThomas H. Cormen, Charles Eric Leiserson, Ronald L. Rivest, Clifford Stein. |
|
| 250 | _aThird edition. | ||
| 260 |
_aCambridge, Mass : _bMIT Press, _c2009. |
||
| 300 |
_a1 online resource (xix, 1292 pages) : _billustrations ; _c26 cm. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_aunmediated _bn _2rdamedia |
||
| 338 |
_avolume _bnc _2rdacarrier |
||
| 500 | _aincludes index. | ||
| 520 | _aThis edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks. | ||
| 650 | _aComputer Science | ||
| 700 | 1 | _aLeiserson, Charles Eric. | |
| 700 | 1 | _aRivest, Ronald L. | |
| 700 | 1 | _aStein, Clifford. | |
| 942 | _2ddc | ||
| 999 |
_c1007 _d1007 |
||