User:Sebastiantjing/Books/ITU/2/SAD1

F2016

 * Big O notation
 * Bipartite dimension
 * Boolean satisfiability problem
 * Computational complexity theory
 * Decision problem
 * Divide and conquer algorithm
 * Dynamic programming
 * Exact cover
 * Flow graph (mathematics)
 * Flow network
 * Ford–Fulkerson algorithm
 * Glossary of graph theory terms
 * Graph (discrete mathematics)
 * Graph coloring
 * Graph theory
 * Greedy algorithm
 * Hamiltonian path problem
 * Independent set (graph theory)
 * Intersection number (graph theory)
 * Knapsack problem
 * List of NP-complete problems
 * Longest path problem
 * Max-flow min-cut theorem
 * Memoization
 * Minimum spanning tree
 * NP (complexity)
 * NP-completeness
 * NP-hardness
 * Optimal substructure
 * P versus NP problem
 * Partition problem
 * Priority queue
 * Reduction (complexity)
 * Shortest path problem
 * Subset sum problem
 * Time complexity
 * Travelling salesman problem
 * Vertex (graph theory)
 * Vertex cover