OurBigBook Wikipedia Bot
Documentation
Graph algorithms
OurBigBook Wikipedia Bot
Mathematics
Fields of mathematics
Applied mathematics
Algorithms
toc
wiki
nosplit
articles:
121
Table of contents
121
1. Flooding algorithms
link
nosplit
Graph algorithms
2. Graph drawing
link
nosplit
Graph algorithms
3. Graph rewriting
link
nosplit
Graph algorithms
4. A* search algorithm
link
nosplit
Graph algorithms
5. Alpha–beta pruning
link
nosplit
Graph algorithms
6. Aperiodic graph
link
nosplit
Graph algorithms
7. B*
link
nosplit
Graph algorithms
8. Barabási–Albert model
link
nosplit
Graph algorithms
9. Belief propagation
link
nosplit
Graph algorithms
10. Bellman–Ford algorithm
link
nosplit
Graph algorithms
11. Bianconi–Barabási model
link
nosplit
Graph algorithms
12. Bidirectional search
link
nosplit
Graph algorithms
13. Blossom algorithm
link
nosplit
Graph algorithms
14. Borůvka's algorithm
link
nosplit
Graph algorithms
15. Bottleneck traveling salesman problem
link
nosplit
Graph algorithms
16. Breadth-first search
link
nosplit
Graph algorithms
17. Bron–Kerbosch algorithm
link
nosplit
Graph algorithms
18. Chaitin's algorithm
link
nosplit
Graph algorithms
19. Clique percolation method
link
nosplit
Graph algorithms
20. Closure problem
link
nosplit
Graph algorithms
21. Color-coding
link
nosplit
Graph algorithms
22. Colour refinement algorithm
link
nosplit
Graph algorithms
23. Contraction hierarchies
link
nosplit
Graph algorithms
24. Courcelle's theorem
link
nosplit
Graph algorithms
25. D*
link
nosplit
Graph algorithms
26. DSatur
link
nosplit
Graph algorithms
27. Degeneracy (graph theory)
link
nosplit
Graph algorithms
28. Depth-first search
link
nosplit
Graph algorithms
29. Dijkstra's algorithm
link
nosplit
Graph algorithms
30. Dijkstra–Scholten algorithm
link
nosplit
Graph algorithms
31. Dinic's algorithm
link
nosplit
Graph algorithms
32. Disparity filter algorithm of weighted network
link
nosplit
Graph algorithms
33. Double pushout graph rewriting
link
nosplit
Graph algorithms
34. Dulmage–Mendelsohn decomposition
link
nosplit
Graph algorithms
35. Dynamic connectivity
link
nosplit
Graph algorithms
36. Dynamic link matching
link
nosplit
Graph algorithms
37. Edmonds' algorithm
link
nosplit
Graph algorithms
38. Edmonds–Karp algorithm
link
nosplit
Graph algorithms
39. Euler tour technique
link
nosplit
Graph algorithms
40. Extremal Ensemble Learning
link
nosplit
Graph algorithms
41. FKT algorithm
link
nosplit
Graph algorithms
42. Floyd–Warshall algorithm
link
nosplit
Graph algorithms
43. Force-directed graph drawing
link
nosplit
Graph algorithms
44. Ford–Fulkerson algorithm
link
nosplit
Graph algorithms
45. Fringe search
link
nosplit
Graph algorithms
46. Gallai–Edmonds decomposition
link
nosplit
Graph algorithms
47. Girvan–Newman algorithm
link
nosplit
Graph algorithms
48. Goal node (computer science)
link
nosplit
Graph algorithms
49. Gomory–Hu tree
link
nosplit
Graph algorithms
50. Graph bandwidth
link
nosplit
Graph algorithms
51. Graph edit distance
link
nosplit
Graph algorithms
52. Graph embedding
link
nosplit
Graph algorithms
53. Graph kernel
link
nosplit
Graph algorithms
54. Graph neural network
link
nosplit
Graph algorithms
55. Graph reduction
link
nosplit
Graph algorithms
56. Graph traversal
link
nosplit
Graph algorithms
57. HCS clustering algorithm
link
nosplit
Graph algorithms
58. Hall-type theorems for hypergraphs
link
nosplit
Graph algorithms
59. Havel–Hakimi algorithm
link
nosplit
Graph algorithms
60. Hierarchical clustering of networks
link
nosplit
Graph algorithms
61. Hopcroft–Karp algorithm
link
nosplit
Graph algorithms
62. Initial attractiveness
link
nosplit
Graph algorithms
63. Iterative compression
link
nosplit
Graph algorithms
64. Iterative deepening A*
link
nosplit
Graph algorithms
65. Iterative deepening depth-first search
link
nosplit
Graph algorithms
66. Johnson's algorithm
link
nosplit
Graph algorithms
67. Journal of Graph Algorithms and Applications
link
nosplit
Graph algorithms
68. Jump point search
link
nosplit
Graph algorithms
69. Junction tree algorithm
link
nosplit
Graph algorithms
70. KHOPCA clustering algorithm
link
nosplit
Graph algorithms
71. K shortest path routing
link
nosplit
Graph algorithms
72. Karger's algorithm
link
nosplit
Graph algorithms
73. Kleitman–Wang algorithms
link
nosplit
Graph algorithms
74. Knight's tour
link
nosplit
Graph algorithms
75. Knowledge graph embedding
link
nosplit
Graph algorithms
76. Kosaraju's algorithm
link
nosplit
Graph algorithms
77. Kruskal's algorithm
link
nosplit
Graph algorithms
78. LASCNN algorithm
link
nosplit
Graph algorithms
79. Lexicographic breadth-first search
link
nosplit
Graph algorithms
80. Link prediction
link
nosplit
Graph algorithms
81. Longest path problem
link
nosplit
Graph algorithms
82. METIS
link
nosplit
Graph algorithms
83. MaxCliqueDyn maximum clique algorithm
link
nosplit
Graph algorithms
84. Minimax
link
nosplit
Graph algorithms
85. Minimum bottleneck spanning tree
link
nosplit
Graph algorithms
86. Misra & Gries edge coloring algorithm
link
nosplit
Graph algorithms
87. Network flow problem
link
nosplit
Graph algorithms
88. Network simplex algorithm
link
nosplit
Graph algorithms
89. Nonblocking minimal spanning switch
link
nosplit
Graph algorithms
90. PageRank
link
nosplit
Graph algorithms
91. Parallel all-pairs shortest path algorithm
link
nosplit
Graph algorithms
92. Parallel breadth-first search
link
nosplit
Graph algorithms
93. Parallel single-source shortest path algorithm
link
nosplit
Graph algorithms
94. Path-based strong component algorithm
link
nosplit
Graph algorithms
95. Pre-topological order
link
nosplit
Graph algorithms
96. Prim's algorithm
link
nosplit
Graph algorithms
97. Proof-number search
link
nosplit
Graph algorithms
98. Push–relabel maximum flow algorithm
link
nosplit
Graph algorithms
99. Recursive largest first algorithm
link
nosplit
Graph algorithms
100. Reverse-delete algorithm
link
nosplit
Graph algorithms
101. SMA*
link
nosplit
Graph algorithms
102. Seidel's algorithm
link
nosplit
Graph algorithms
103. Sethi–Ullman algorithm
link
nosplit
Graph algorithms
104. Shortest path faster algorithm
link
nosplit
Graph algorithms
105. Spectral layout
link
nosplit
Graph algorithms
106. Stoer–Wagner algorithm
link
nosplit
Graph algorithms
107. Subgraph isomorphism problem
link
nosplit
Graph algorithms
108. Suurballe's algorithm
link
nosplit
Graph algorithms
109. Tarjan's off-line lowest common ancestors algorithm
link
nosplit
Graph algorithms
110. Tarjan's strongly connected components algorithm
link
nosplit
Graph algorithms
111. Theta*
link
nosplit
Graph algorithms
112. Topological sorting
link
nosplit
Graph algorithms
113. Transit node routing
link
nosplit
Graph algorithms
114. Transitive closure
link
nosplit
Graph algorithms
115. Transitive reduction
link
nosplit
Graph algorithms
116. Travelling salesman problem
link
nosplit
Graph algorithms
117. Tree traversal
link
nosplit
Graph algorithms
118. Widest path problem
link
nosplit
Graph algorithms
119. Wiener connector
link
nosplit
Graph algorithms
120. Yen's algorithm
link
nosplit
Graph algorithms
121. Zero-weight cycle problem
link
nosplit
Graph algorithms
Ancestors
Algorithms
Applied mathematics
Fields of mathematics
Mathematics
OurBigBook Wikipedia Bot