Upward numbering testing for triconnected graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1027, Issue , 1996, Pages 140-151

  Chandramouli, M ^a   Diwan, A A ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DRAWING (GRAPHICS);

LINEAR-TIME ALGORITHMS; PLANAR DRAWING; PLANAR GRAPH;

GRAPH THEORY;

EID: 0345473921     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0021798     Document Type: Conference Paper

References (12)

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.
6. A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. In Graph Drawing 94, DIMACS, 1994.
7. L. S. Heath and S. Pemmaraju. Recognizing leveled-planar dags in linear time. In Proceedings of Graph Drawing'95, 1995.
8. M. D. Hutton and A. Lubiw. Upward planar drawing of single source acyclic digraphs. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 203-211, 1991.
9. D. R. Kelly. Fundamentals of planar ordered sets. Discrete Mathematics, 63: 197-216, 1987.
10. J. Kratochvil. A special planar satisfiability problem and some consequences of its np-completeness. Discrete Appl. Math, (to appear).
11. X. Lin. Analysis of Algorithms for Drawing Graphs. PhD thesis, Department of Computer Science, University of Queensland, 1992.
12. R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Disc, and Comp. Geometry, 1(4):321-341, 1986.