Level planar embedding in linear time

Journal of Graph Algorithms and Applications

Volumn 6, Issue 1, 2002, Pages 67-113

  Jünger, Michael ^a   Leipert, Sebastian ^b  

^a UNIVERSITY OF COLOGNE   (Germany)

^b CENTER OF ADVANCED EUROPEAN STUDIES AND RESEARCH CAESAR   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

ACYCLIC GRAPHS; EDGE CROSSING; GRAPH G; LEVEL GRAPHS; LINEAR TIME; PLANAR EMBEDDINGS; PLANAR GRAPH; PLANARITY; VERTEX SET; VERTICAL DIRECTION;

DIRECTED GRAPHS;

EID: 4043087635     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00045     Document Type: Conference Paper

References (16)

1. Booth, K. and Lueker, G. (1976). Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences, 13, 335-379.
2. Chiba, N., Nishizeki, T., Abe, S., and Ozawa, T. (1985). A linear algorithm for embedding planar graphs using PQ-trees. Journal of Computer and System Sciences, 30, 54-76.
3. Di Battista, G. and Tamassia, R. (1988). Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science, 61, 175-198.
4. Di Battista, G., Tamassia, R., and Tollis, I. G. (1992). Constrained visibility representations of graphs. Information Processing Letters, 41, 1-7.
5. Even, S. and Tarjan, R. E. (1976). Computing an st-numbering. Theoretical Computer Science, 2, 339-344.
6. Fulkerson, D. R. and Gross, O. A. (1965). Incidence matrices and interval graphs. Pacific J. Mathematics, 15, 835-855.
7. Heath, L. S. and Pemmaraju, S. V. (1995). Recognizing leveled-planar dags in linear time. In F. J. Brandenburg, editor, Proc. Graph Drawing '95 , volume 1027 of Lecture Notes in Computer Science, pages 300-311. Springer Verlag.
8. Heath, L. S. and Pemmaraju, S. V. (1996). Stack and queue layouts of directed acyclic graphs: Part II. Technical report, Department of Computer Science, Virginia Polytechnic Institute & State University.
9. Jünger, M., Leipert, S., and Mutzel, P. (1998). Level planarity testing in linear time. In S. Whitesides, editor, Graph Drawing '98 , volume 1547 of Lecture Notes in Computer Science, pages 224-237. Springer Verlag.
10. Jünger, M., Leipert, S., and Mutzel, P. (1999). Level planarity testing in linear time (full version). Technical report, Institut für Informatik, Universität zu Köln.
11. Kant, G. (1993). A more compact visibillity representation. In J. van Leeuwen, editor, Proc. 19th International Workshop on Graph-Theoretical Concepts in Computer Science , Lecture Notes in Computer Science. Springer Verlag.
12. Leipert, S. (1998). Level Planarity Testing and Embedding in Linear Time. Ph.D. thesis, Universität zu Köln.
13. Luccio, F., Mazzone, S., and Wong, C. (1987). A note on visibility graphs. Discrete Mathematics, 64, 209-219.
14. Rosenstiehl, P. and Tarjan, R. E. (1986). Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete and Computational Geometry, 1, 343-353.
15. Tamassia, R. and Tollis, I. G. (1986). A unified approach to visibillity representations of planar graphs. Discrete and Computational Geometry, 1, 321-341.
16. Tamassia, R. and Tollis, I. G. (1989). Tessellation representations of planar graphs. In Proc. 27th Allerton Conf. Communication Control Computing , pages 48-57.