Knuthian Drawings of Series-Parallel Flowcharts

Goodrich, Michael T. and Johnson, Timothy and Torres, Manuel (2015) Knuthian Drawings of Series-Parallel Flowcharts. In: Graph Drawing and Network Visualization, 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 556-557(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_49).

Full text not available from this repository.

Abstract

In 1963, Knuth published the first paper on a computer algorithm for a graph drawing problem, entitled “Computer-drawn Flowcharts” [8]. In this paper, Knuth describes an algorithm that takes as input an n-vertex directed graph G that represents a flowchart and, using the modern language of graph drawing, produces an orthogonal drawing of G.

Item Type: Conference Poster
Classifications: P Styles > P.600 Poly-line > P.600.700 Orthogonal
P Styles > P.840 Upward
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1523

Actions (login required)

View Item View Item