User:Rogério Brito/Books/(Combinatorial) Graph algorithms

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Please select an appropriate cover image for this book. See "Template:Saved book" for instructions."
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
Select format to download:

PDF (A4) · PDF (Letter)

Order a printed copy from these publishers: PediaPress
About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] Recent Changes ]


(Combinatorial) Graph algorithms[edit]

Graph search problem and basic algorithms
Graph traversal
Tree traversal
Search algorithm
Breadth-first search
Depth-first search
Eulerian path
Bridge (graph theory)
More specialized search algorithms
Depth-limited search
Iterative deepening depth-first search
Lexicographic breadth-first search
Uniform-cost search
Graph search applications
Bipartite graph
Connected component (graph theory)
Biconnected component
Strongly connected component
Kosaraju's algorithm
Tarjan's strongly connected components algorithm
Path-based strong component algorithm
2-satisfiability
Shortest-path algorithms
Shortest path problem
Shortest path tree
Dijkstra's algorithm
Floyd–Warshall algorithm
Bellman–Ford algorithm
Johnson's algorithm
Shortest-path applications
Transitive closure
Spanning trees
Minimum spanning tree
Kruskal's algorithm
Prim's algorithm
Borůvka's algorithm
Reverse-delete algorithm
Network flows
Flow network
Maximum flow problem
Circulation problem
Ford–Fulkerson algorithm
Edmonds–Karp algorithm
Dinic's algorithm
Push–relabel maximum flow algorithm
Minimum-cost flow problem
Nowhere-zero flow
Multi-commodity flow problem
Applications of maximum-flow
Max-flow min-cut theorem
Menger's theorem
König's theorem (graph theory)
Hopcroft–Karp algorithm
Blossom algorithm
Karger's algorithm
Programming paradigms
Greedy algorithm
Dynamic programming
Hill climbing
Memoization
Supplementary topics
Modular decomposition