Category:Graph algorithms
Wikimedia Commons has media related to Graph algorithms.
Graph algorithms solve problems related to graph theory.
Subcategories
This category has the following 3 subcategories, out of 3 total.
F
- Flooding algorithms (5 P)
G
- Graph rewriting (11 P)
Pages in category "Graph algorithms"
The following 139 pages are in this category, out of 139 total. This list may not reflect recent changes.
B
C
D
E
F
G
- Gallai–Edmonds decomposition
- Girvan–Newman algorithm
- Goal node (computer science)
- Gomory–Hu tree
- Graph bandwidth
- Graph Coarsening Algorithm
- Graph edit distance
- Graph embedding
- Graph isomorphism
- Graph isomorphism problem
- Graph kernel
- Graph neural network
- Graph reduction
- Graph traversal
- Group centrality
- GYO algorithm