Category:Graph drawing
 | Computing portal |
Here is a list of articles in the Graph drawing category of the Computing portal that unifies foundations of mathematics and computations using computers.
See also Category:Geometric graph theory and Category:Topological graph theory. This category is about Graph (discrete mathematics)s, as defined in discrete mathematics, and not about graph of a function.
Subcategories
This category has the following 2 subcategories, out of 2 total.
Pages in category "Graph drawing"
The following 35 pages are in this category, out of 35 total.
- Graph drawing (computing)
A
- Angular resolution (graph drawing) (computing)
- Arc diagram (computing)
- Area (graph drawing) (computing)
- Automatic layout (computing)
B
- Bend minimization (computing)
C
- Circular layout (computing)
- Clustered planarity (computing)
- Coffman–Graham algorithm (computing)
- Concept map (computing)
- Crossing number (graph theory) (computing)
- Crossing number inequality (computing)
- Crossing Numbers of Graphs (computing)
D
- Data flow diagram (computing)
- Data-flow diagram (computing)
- Dendrogram (computing)
- Dominance drawing (computing)
- DOT (graph description language) (computing)
F
- Force-directed graph drawing (computing)
H
- Hasse diagram (computing)
- Hyperbolic tree (computing)
I
- International Symposium on Graph Drawing (computing)
J
- Journal of Graph Algorithms and Applications (computing)
L
- Layered graph drawing (computing)
P
- Parallel redrawing (computing)
R
- RAC drawing (computing)
- Radial tree (computing)
S
- Simultaneous embedding (computing)
- Slope number (computing)
- Sociogram (computing)
- Spectral layout (computing)
- State diagram (computing)
- Stress majorization (computing)
T
- Turán's brick factory problem (computing)
- Tutte embedding (computing)
Mathematics
Organizations
Books
About