Pitfalls of using pq-trees in automatic graph drawing

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

Volumn 1353, Issue , 1997, Pages 193-204

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

^a UNIVERSITY OF COLOGNE   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIRECTED GRAPHS; DRAWING (GRAPHICS); FORESTRY;

CONSTRUCTING ALGORITHMS; DIRECTED ACYCLIC GRAPH (DAG); GRAPH DRAWING; GRAPH DRAWING ALGORITHMS; PLANAR SUBGRAPHS; PLANARITY; PQ-TREE;

TREES (MATHEMATICS);

EID: 84957352759     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63938-1_62     Document Type: Conference Paper

References (13)

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 Nardelli, E. (1988). Hierarchies and planarity theory. IEEE Transactions on systems, man, and cybernetics, 18(6), 1035-1046.
4. Even, S. (1979). Graph Algorithms. Computer Science Press, Potomac, Maryland.
5. Even, S. and Tarjan, R. E. (1976). Computing anst-numbering. Theoretical Computer Science, 2, 339-344.
6. Heath, L. and Pemmaraju, S. (1996a). 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.
7. Heath, L. and Pemmaraju, S. (1996b). Stack and queue layouts of directed acyclic graphs: Part II. Technical report, Department of Computer Science, Virginia Polytechnic Institute & State University.
8. Jayakumar, R., Thulasiraman, K., and Swamy, M. (1986). On maximal planarization of non-planar graphs. IEEE Transactions on Circuits Systems, 33(8), 843-844.
9. Jayakumar, R., Thulasiraman, K., and Swamy, M. (1989). On O(n 2) algorithms for graph planarization. IEEE Transactions on Computer-Aided Design, 8(3), 257-267.
10. Jünger, M., Leipert, S., and Mutzel, P. (1996). On computing a maximal planar subgraph using PQ-trees. Technical Report 96.227, Institut für Informatik der Universität zu Köln.
11. 2) maximal planarization algorithm based on PQ-trees. Technical 1Keport RUU-CS-92-03, Department of Computer Science, Utrecht University.
12. Lempel, A., Even, S., and Cederbaum, I. (1967). An algorithm for planarity'testing of graphs. In Theory of Graphs: International Symposium: Rome, July 1966, pages 215-232. Gordon and Breach, New York.
13. Ozawa, T. and Takahashi, H. (1981). A graph-planarization algorithm and its application to random graphs. In Graph Theory and Algorithms, volume 108 of Lecture Notes in Computer Science, pages 95-107. Springer Verlag.