Design and analysis of computer algorithms

Please use this identifier to cite or link to this item: https://thuvienso.dau.edu.vn/handle/DHKTDN/6456

Full metadata record

DC Field	Value	Language
dc.contributor.author	David, M.Mount	-
dc.date.accessioned	2014-12-12T03:38:45Z	-
dc.date.available	2014-12-12T03:38:45Z	-
dc.date.issued	2013	-
dc.identifier.uri	https://thuvienso.dau.edu.vn/handle/DHKTDN/6456	-
dc.description.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	vi
dc.language.iso	en	vi
dc.subject	programming	vi
dc.title	Design and analysis of computer algorithms	vi
dc.type	Book	vi
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