Category:Directed graphs
 | Computing portal |
Here is a list of articles in the Directed graphs category of the Computing portal that unifies foundations of mathematics and computations using computers.
Pages in category "Directed graphs"
The following 31 pages are in this category, out of 31 total.
A
- Aczel's anti-foundation axiom (computing)
- Arborescence (graph theory) (computing)
B
- BEST theorem (computing)
C
- Cause–effect graph (computing)
D
- De Bruijn graph (computing)
- Dependency graph (computing)
- Directed acyclic graph (computing)
- Directed graph (computing)
- Directed pseudoforest (computing)
F
- Feedback arc set (computing)
- Flow graph (mathematics) (computing)
I
- Implication graph (computing)
K
- Kautz graph (computing)
M
- Multitree (computing)
N
- Network flow problem (computing)
- New digraph reconstruction conjecture (computing)
P
- Polygraph (mathematics) (computing)
- Pre-topological order (computing)
- Propositional directed acyclic graph (computing)
Q
- Quiver (mathematics) (computing)
R
- Random surfing model (computing)
S
- Semi-invariant of a quiver (computing)
- Skew-symmetric graph (computing)
- St-connectivity (computing)
- Strongly connected component (computing)
T
- Table of vertex-symmetric digraphs (computing)
- Topological sorting (computing)
- Tournament (graph theory) (computing)
- Transpose graph (computing)
W
- Wait-for graph (computing)
- Why–because analysis (computing)
Mathematics
Organizations
Books
About