User:Jack quack/Books/C251


 * Vertex cover
 * Monte Carlo method
 * König's theorem (graph theory)
 * Menger's theorem
 * Miller–Rabin primality test
 * Regular graph
 * Knapsack problem
 * Travelling salesman problem
 * Stable marriage problem
 * Correctness (computer science)
 * Big O notation
 * Time complexity
 * Best, worst and average case
 * Sorting algorithm
 * Merge sort
 * Quicksort
 * Independent set (graph theory)
 * Divide and conquer algorithm
 * Closest pair of points problem
 * Multiplication algorithm
 * Matrix multiplication
 * Master theorem
 * Analysis of algorithms
 * Glossary of graph theory
 * Connected component (graph theory)
 * Bipartite graph
 * Parity (mathematics)
 * Directed acyclic graph
 * Topological sorting
 * Interval scheduling
 * Depth-first search
 * Breadth-first search
 * Dijkstra's algorithm
 * Greedy algorithm
 * Dynamic programming
 * Optimal substructure
 * Memoization
 * Bellman–Ford algorithm
 * Minimum cut
 * Maximum flow problem
 * Ford–Fulkerson algorithm
 * Edge disjoint shortest pair algorithm
 * Max-flow min-cut theorem
 * Matching (graph theory)
 * Segmentation (image processing)
 * Circulation problem
 * Kruskal's algorithm
 * Disjoint sets
 * Minimum spanning tree
 * Prim's algorithm
 * Priority queue
 * Disjoint-set data structure
 * Linked list
 * Primality test
 * Hash function
 * Randomized algorithm