Category:Graph algorithms
 | Computing portal |
Here is a list of articles in the category Graph algorithms of the Computing portal that unifies foundations of mathematics and computations using computers.
Graph algorithms solve problems related to graph theory.
Subcategories
This category has the following 3 subcategories, out of 3 total.
C
G
Pages in category "Graph algorithms"
The following 127 pages are in this category, out of 127 total.
A
- A* search algorithm (computing)
- Algorithmic version for Szemerédi regularity partition (computing)
- Alpha–beta pruning (computing)
- Aperiodic graph (computing)
B
- B* (computing)
- Barabási–Albert model (computing)
- Belief propagation (computing)
- Bellman–Ford algorithm (computing)
- Bianconi–Barabási model (computing)
- Bidirectional search (computing)
- Borůvka's algorithm (computing)
- Bottleneck traveling salesman problem (computing)
- Breadth-first search (computing)
- Bron–Kerbosch algorithm (computing)
- Bully algorithm (computing)
C
- Centrality (computing)
- Chaitin's algorithm (computing)
- Christofides algorithm (computing)
- Clique percolation method (computing)
- Closure problem (computing)
- Color-coding (computing)
- Contraction hierarchies (computing)
- Courcelle's theorem (computing)
- Cuthill–McKee algorithm (computing)
D
- D* (computing)
- Degeneracy (graph theory) (computing)
- Depth-first search (computing)
- Dijkstra's algorithm (computing)
- Dijkstra–Scholten algorithm (computing)
- Dinic's algorithm (computing)
- Disparity filter algorithm of weighted network (computing)
- Double pushout graph rewriting (computing)
- DSatur (computing)
- Dulmage–Mendelsohn decomposition (computing)
- Dynamic connectivity (computing)
- Dynamic link matching (computing)
E
- Edmonds' algorithm (computing)
- Blossom algorithm (computing)
- Edmonds–Karp algorithm (computing)
- Euler tour technique (computing)
- External memory graph traversal (computing)
- Extremal Ensemble Learning (computing)
F
- FKT algorithm (computing)
- Flooding algorithm (computing)
- Floyd–Warshall algorithm (computing)
- Force-directed graph drawing (computing)
- Ford–Fulkerson algorithm (computing)
- Fringe search (computing)
G
- Gallai–Edmonds decomposition (computing)
- Girvan–Newman algorithm (computing)
- Goal node (computer science) (computing)
- Gomory–Hu tree (computing)
- Graph bandwidth (computing)
- Graph edit distance (computing)
- Graph embedding (computing)
- Graph isomorphism (computing)
- Graph isomorphism problem (computing)
- Graph kernel (computing)
- Graph reduction (computing)
- Graph traversal (computing)
H
- Hall-type theorems for hypergraphs (computing)
- Havel–Hakimi algorithm (computing)
- HCS clustering algorithm (computing)
- Hierarchical closeness (computing)
- Hierarchical clustering of networks (computing)
- Hopcroft–Karp algorithm (computing)
I
- Iterative deepening A* (computing)
- Initial attractiveness (computing)
- Iterative compression (computing)
- Iterative deepening depth-first search (computing)
J
- JGraphT (software)
- Johnson's algorithm (computing)
- Journal of Graph Algorithms and Applications (computing)
- Jump point search (computing)
- Junction tree algorithm (computing)
K
- K shortest path routing (computing)
- Karger's algorithm (computing)
- KHOPCA clustering algorithm (computing)
- Kleitman–Wang algorithms (computing)
- Knight's tour (computing)
- Knuth's Simpath algorithm (computing)
- Kosaraju's algorithm (computing)
- Kruskal's algorithm (computing)
L
- Lexicographic breadth-first search (computing)
- Longest path problem (computing)
M
- MaxCliqueDyn maximum clique algorithm (computing)
- METIS (computing)
- Minimax (computing)
- Minimum bottleneck spanning tree (computing)
- Misra & Gries edge coloring algorithm (computing)
N
- Nearest neighbour algorithm (computing)
- Network flow problem (computing)
- Network simplex algorithm (computing)
- Nonblocking minimal spanning switch (computing)
P
- PageRank (computing)
- Parallel all-pairs shortest path algorithm (computing)
- Parallel breadth-first search (computing)
- Path-based strong component algorithm (computing)
- Pre-topological order (computing)
- Prim's algorithm (computing)
- Proof-number search (computing)
- Push–relabel maximum flow algorithm (computing)
R
- Reverse-delete algorithm (computing)
- Rocha–Thatte cycle detection algorithm (computing)
S
- Seidel's algorithm (computing)
- Semantic Brand Score (computing)
- Sethi–Ullman algorithm (computing)
- Shortest Path Faster Algorithm (computing)
- SMA* (computing)
- Spectral layout (computing)
- Spreading activation (computing)
- Stoer–Wagner algorithm (computing)
- Subgraph isomorphism problem (computing)
- Suurballe's algorithm (computing)
T
- Tarjan's off-line lowest common ancestors algorithm (computing)
- Tarjan's strongly connected components algorithm (computing)
- Theta* (computing)
- Topological sorting (computing)
- Transit node routing (computing)
- Transitive closure (computing)
- Transitive reduction (computing)
- Travelling salesman problem (computing)
- Tree traversal (computing)
W
- Widest path problem (computing)
- Wiener connector (computing)
Y
- Yen's algorithm (computing)
Z
- Zero-weight cycle problem (computing)
Mathematics
Organizations
Books
About