User:Rwe1812/Books/Graph Cuts


 * Graph Cuts
 * Graph cuts in computer vision
 * Segmentation-based object categorization
 * Maximum a posteriori estimation


 * Graphs
 * Graph (mathematics)
 * Directed graph
 * Connectivity (graph theory)
 * K-vertex-connected graph
 * Cut (graph theory)
 * Graph partition
 * Flow network
 * Graph coloring
 * Menger's theorem
 * König's theorem (graph theory)


 * Max-Flow / Min-Cut
 * Max-flow min-cut theorem
 * Maximum flow problem
 * Minimum cut
 * Maximum cut


 * Algorithms
 * Edmonds–Karp algorithm
 * Dinic's algorithm
 * Ford–Fulkerson algorithm
 * Push–relabel maximum flow algorithm
 * Hopcroft–Karp algorithm


 * Optimization
 * Mathematical optimization
 * Optimization problem
 * Duality (optimization)
 * Duality gap
 * Convex optimization
 * Convex function
 * Convex set
 * Linear programming


 * Appendix
 * Graph traversal
 * Breadth-first search
 * Depth-first search
 * Disjoint-set data structure