# Upward Graph Drawing

@inproceedings{Didimo2016UpwardGD, title={Upward Graph Drawing}, author={Walter Didimo}, booktitle={Encyclopedia of Algorithms}, year={2016} }

- Published in Encyclopedia of Algorithms 2016
DOI:10.1007/978-1-4939-2864-4_653

Upward graph drawing is concerned with computing two-dimensional layouts of directed graphs where all edges flow in the upward direction. Namely, given a directed graph G.V;E/ (also called a digraph for short), an upward drawing of G is a drawing such that: (i) each vertex v 2 V is mapped to a distinct point pv of the plane and (ii) each edge .u; v/ 2 E is drawn as a simple curve from pu and pv, monotonically increasing in the upward direction. Clearly, G admits an upward drawing only if it… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-2 OF 2 CITATIONS

## A Survey on Graph Drawing Beyond Planarity

VIEW 5 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED