Recognizing Leveled-Planar Dags in Linear Time

Heath, Lenwood S. and Pemmaraju, Sriram V. (1996) Recognizing Leveled-Planar Dags in Linear Time. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 300-311 (Official URL: http://dx.doi.org/10.1007/BFb0021813).

Full text not available from this repository.

Abstract

Item Type:Conference Paper
Additional Information:10.1007/BFb0021813
Classifications:G Algorithms and Complexity > G.999 Others
M Methods > M.600 Planar
ID Code:158

Repository Staff Only: item control page

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.