Knuthian Drawings of Series-Parallel Flowcharts
classification
💻 cs.CG
cs.DS
keywords
series-parallelalgorithmsdegree-threedigraphsdrawingdrawingsflowchartsknuthian
read the original abstract
Inspired by a classic paper by Knuth, we revisit the problem of drawing flowcharts of loop-free algorithms, that is, degree-three series-parallel digraphs. Our drawing algorithms show that it is possible to produce Knuthian drawings of degree-three series-parallel digraphs with good aspect ratios and small numbers of edge bends.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.