User:Ragasvnvs/Books/GraphAlgos
 | 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 ] | ||||||||
- A* search algorithm
- Algorithmic version for Szemerédi regularity partition
- Alpha–beta pruning
- Aperiodic graph
- B*
- Barabási–Albert model
- Belief propagation
- Bellman–Ford algorithm
- Borůvka's algorithm
- Bottleneck traveling salesman problem
- Breadth-first search
- Bron–Kerbosch algorithm
- Centrality
- Chaitin's algorithm
- Christofides algorithm
- Clique percolation method
- Closure problem
- Color-coding
- Contraction hierarchies
- Courcelle's theorem
- Cuthill–McKee algorithm
- D*
- Depth-first search
- Depth-limited search
- Dijkstra's algorithm
- Dijkstra–Scholten algorithm
- Dinic's algorithm
- Double pushout graph rewriting
- Dulmage–Mendelsohn decomposition
- Edmonds' algorithm
- Blossom algorithm
- Edmonds–Karp algorithm
- Euler tour technique
- FKT algorithm
- Flooding algorithm
- Flow network
- Floyd–Warshall algorithm
- Force-directed graph drawing
- Ford–Fulkerson algorithm
- Fringe search
- Girvan–Newman algorithm
- Goal node (computer science)
- Gomory–Hu tree
- Grafting (algorithm)
- Grafting (ordered tree)
- Graph bandwidth
- Graph embedding
- Graph isomorphism
- Graph isomorphism problem
- Graph kernel
- Graph reduction
- Graph traversal
- Hierarchical clustering of networks
- Hopcroft–Karp algorithm
- IDA*
- Iterative deepening depth-first search
- Johnson's algorithm
- Journal of Graph Algorithms and Applications
- Jump point search
- K shortest path routing
- Karger's algorithm
- Knight's tour
- Kosaraju's algorithm
- Kruskal's algorithm
- Lexicographic breadth-first search
- Longest path problem
- Minimax
- Minimum cut
- Nearest neighbour algorithm
- Nonblocking minimal spanning switch
- Path-based strong component algorithm
- Prim's algorithm
- Proof-number search
- Push–relabel maximum flow algorithm
- Reverse-delete algorithm
- Sethi–Ullman algorithm
- Shortest Path Faster Algorithm
- Shortest path problem
- SMA*
- Spectral layout
- Strongly connected component
- Subgraph isomorphism problem
- Suurballe's algorithm
- Tarjan's off-line lowest common ancestors algorithm
- Tarjan's strongly connected components algorithm
- Topological sorting
- Transitive closure
- Transitive reduction
- Travelling salesman problem
- Tree traversal
- Uniform-cost search
- Widest path problem
- Yen's algorithm
- Best-first search
- Bidirectional search