User:Larstveito/Books/INF4130

INF4130

 * Max-flow min-cut theorem
 * Fibonacci heap
 * Formal language


 * Np completeness
 * List of NP-complete problems
 * Karp's 21 NP-complete problems
 * Clique problem
 * Boolean satisfiability problem
 * Bipartite graph
 * 3-dimensional matching
 * Graph toughness
 * Hamiltonian path


 * Dino
 * Church–Turing thesis
 * Decision problem
 * Halting problem
 * Turing machine


 * Decidability
 * Decidability (logic)
 * Recursive language


 * String search
 * Boyer–Moore–Horspool algorithm
 * Knuth–Morris–Pratt algorithm
 * Rabin–Karp algorithm
 * Edit distance


 * Triangulation
 * Delaunay triangulation
 * Polygon triangulation


 * Network flow
 * Ford–Fulkerson algorithm
 * Edmonds–Karp algorithm


 * Heuristics
 * Taxicab geometry


 * Matching
 * Hungarian algorithm


 * A*
 * A* search algorithm
 * Minimax
 * Alpha–beta pruning


 * Divide and conquer (Top-down)
 * Divide and conquer algorithms
 * Gift wrapping algorithm


 * Convex hull
 * Convex hull algorithms


 * Dynamic Programming (Bottoms-up)
 * Dynamic programming
 * Subset sum problem
 * Matrix chain multiplication


 * Heaps
 * Leftist tree
 * Binary heap
 * Binomial heap
 * Game tree