Upward Planning of Single-Source Acyclic Digraphs

@article{Hutton1991UpwardPO,
  title={Upward Planning of Single-Source Acyclic Digraphs},
  author={Mike Hutton and Anna Lubiw},
  journal={SIAM J. Comput.},
  year={1991},
  volume={25},
  pages={291-311}
}
An upward plane drawing of a directed acyclic graph is a plane drawing of the graph in which each directed edge is represented as a curve monotone increasing in the vertical direction. Thomassen [14] has given a non-algorithmic, graph-theoretic characterization of those directed graphs with a single source that admit an upward plane drawing. We present an e cient algorithm to test whether a given single-source acyclic digraph has an upward plane drawing and, if so, to nd a representation of one… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Similar Papers

Loading similar papers…