This research was partially supported by National Science Foundation Grant CCR-9009953.
Chapter PDF
References
Giuseppe Di Battista and Enrico Nardelli. Hierarchies and planarity theory. IEEE Transactions on Systems, Man, and Cybernetics, 18:1035–1046, 1988.
Kellogg S. Booth and George S. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences, 13:335–379, 1976.
Mahadevan Chandramouli and A. A. Diwan. Upward numbering testing for triconnected graphs (an extended abstract). Accepted at Graph Drawing 95.
Lenwood S. Heath and Sriram V. Pemmaraju. Stack and queue layouts of posets. Technical Report 93-06, University of Iowa, 1993. Submitted.
Lenwood S. Heath and Sriram V. Pemmaraju. Stack and queue layouts of directed acyclic graphs: Part II. Technical Report 95-06, University of Iowa, 1995. Submitted.
Lenwood S. Heath, Sriram V. Pemmaraju, and Ann Trenk. Stack and queue layouts of directed acyclic graphs. In William T. Trotter, editor, Planar Graphs, pages 5–11, Providence, RI, 1993. American Mathematical Society.
Lenwood S. Heath, Sriram V. Pemmaraju, and Ann Trenk. Stack and queue layouts of directed acyclic graphs: Part I. Technical Report 95-03, University of Iowa, 1995. Submitted.
Lenwood S. Heath and Arnold L. Rosenberg. Laying out graphs using queues. SIAM Journal on Computing, 21(5):927–958, 1992.
Michael D. Hutton and Anna Lubiw. Upward planar drawing of single source acyclic digraphs. In Proceedings of the 2nd Symposium on Discrete Algorithms, pages 203–211, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heath, L.S., Pemmaraju, S.V. (1996). Recognizing leveled-planar dags in linear time. In: Brandenburg, F.J. (eds) Graph Drawing. GD 1995. Lecture Notes in Computer Science, vol 1027. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021813
Download citation
DOI: https://doi.org/10.1007/BFb0021813
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60723-6
Online ISBN: 978-3-540-49351-8
eBook Packages: Springer Book Archive