Please use this identifier to cite or link to this item:
https://thuvienso.dau.edu.vn/handle/DHKTDN/6456| Title: | Design and analysis of computer algorithms |
| Authors: | David, M.Mount |
| Keywords: | programming |
| Issue Date: | 2013 |
| Abstract: | This ebook introduces: mathematical background, review of sorting and selection, dynamic programming, greedy algorithms, graphs, depth-first search, topological sort and strong components, minimum spanning trees and kruskal's alogorithm, prim's and baruvka's algorithms for MSTs, Dijkstra's algorithm for shortest paths, all-pairs shortest paths, NP-completeness, cook's theorem, 3SAT, and Independent set, Clique, vertex cover, and dominating set, subset sum, approximation algorithms, the k-center approximation, approximations |
| URI: | https://thuvienso.dau.edu.vn/handle/DHKTDN/6456 |
| Appears in Collections: | Ngoại Văn |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 6447. Design and analysis of computer algorithms.pdf Restricted Access | 714.81 kB | Adobe PDF |  View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.