User:Rkrish67/Books/Design Analysis Algorithms: Difference between revisions

Revision as of 05:50, 24 May 2014

Revision as of 05:52, 24 May 2014

Line 116:

:[[Dynamic programming]]

;Selected algorithms

:[[Graph theory]]

:[[Topological sorting]]

:[[Dependency graph]]

:[[Tsort (Unix)]]

:[[Prim's algorithm]]

:[[Minimum spanning tree]]

:[[Distributed minimum spanning tree]]

:[[Euclidean minimum spanning tree]]

:[[Minimum spanning tree]]

:[[Bellman–Ford algorithm]]

:[[String searching algorithm]]

Line 136 ⟶ 137:

:[[Randomized algorithms as zero-sum games]]

:[[Monte Carlo algorithm]]

:[[SimplexApproximation algorithm]]

:[[Asymptotic computational complexity]]

:[[Simplex algorithm]]

:[[Polynomial-time approximation scheme]]

;Complexity analysis

:[[Big O notation]]

:[[Asymptotic computational complexity]]

:[[Simplex algorithm]]

:[[Polynomial-time approximation scheme]]

:[[NP-hard]]

:[[NP-complete]]