| 000 | 01748nam a2200421Ia 4500 | ||
|---|---|---|---|
| 001 | 355667 | ||
| 003 | 0000000000 | ||
| 005 | 20211104093430.0 | ||
| 008 | 181203s2019 nju b 001 0 eng | ||
| 010 | _a2018056450 | ||
| 020 | _a9781786346759 (hc : alk. paper) | ||
| 035 | _a20765218 | ||
| 040 |
_aDLC _cDLC _erda |
||
| 050 |
_aQA 9.58 _b.V59 2019 |
||
| 100 |
_aVermani, Lekh Raj _9128268 |
||
| 245 | 3 |
_aAn elementary approach to design and analysis of algorithms / _cby Lekh Raj Vermani (Kurukshetra University, India) and Shalini Vermani (Apeejay School of Management, India). |
|
| 264 |
_aNew Jersey : _bWorld Scientific, _cc2019. |
||
| 300 |
_axvii, 515 pages _c23 cm. |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aunmediated _2rdamedia |
||
| 338 |
_avolume _2rdacarrier |
||
| 504 | _aIncludes bibliographical references and index. | ||
| 520 | _a All Pairs Shortest Paths | ||
| 520 | _a Backtracking | ||
| 520 | _a Divide and Conquer | ||
| 520 | _a Dynamic Programming | ||
| 520 | _a Elementary Graph Algorithms | ||
| 520 | _a Flow Networks | ||
| 520 | _a Greedy Algorithms | ||
| 520 | _a Minimal Spanning Tree | ||
| 520 | _a Polynomial Multiplication, to ways of solving NP-Complete Problems, supported with comprehensive, and detailed problems and solutions, making it an ideal resource to those studying computer science, computer engineering and information technology.--Abebooks.com | ||
| 520 | _a Single-Source Shortest Paths | ||
| 520 | _aThis book introduces a set of concepts in solving problems computationally such as Growth of Functions | ||
| 650 |
_aAlgorithms _920852 |
||
| 700 |
_aVermani, Shalini, _9128269 |
||
| 942 | _cCIR | ||
| 999 |
_c91955 _d91955 |
||