Author:
Chandramouli M.,Diwan A. A.
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. G. Di Battista and E. Nardelli. An Algorithm for Planarity Testing of Hierarchical Graphs, volume 246 of Lecture Notes in Computer Science, pages 277–289. Springer-Verlag, 1987.
2. G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science, 61:175–198, 1988.
3. P. Bertolazzi, G. Di Battista, G. Liotta, and C. Mannino. Upward drawings of triconnected digraphs. Algorithmica, to appear.
4. M. Chandramouli. Upward Planar Graph Drawings. PhD thesis, IIT Bombay, 1994.
5. M. Chandramouli and A. A. Diwan. Intersection graphs of horizontal and vertical line segments in the plane, 1992. Unpublished manuscript.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Clustered Level Planarity;SOFSEM 2004: Theory and Practice of Computer Science;2004
2. Stack and Queue Layouts of Directed Acyclic Graphs: Part II;SIAM Journal on Computing;1999-01