User:Rwe1812/Books/Graph Cuts
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
- 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