Category:Graph algorithms
From HandWiki
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 2 subcategories, out of 2 total.
G
- Graph rewriting (11 P)
Pages in category "Graph algorithms"
The following 140 pages are in this category, out of 140 total.
A
B
C
D
- D*
- Degeneracy (graph theory)
- Depth-first search
- Dijkstra's algorithm
- Dijkstra–Scholten algorithm
- Dinic's algorithm
- Disparity filter algorithm of weighted network
- Distinctiveness centrality
- Double pushout graph rewriting
- DSatur
- Dulmage–Mendelsohn decomposition
- Dynamic connectivity
- Dynamic link matching
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
