Level planarity testing in linear time

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

Volumn 1547, Issue , 1999, Pages 224-237

  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

EID: 84957872294     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_17     Document Type: Conference Paper

References (6)

1. K. Booth and G. 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.
2. N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa. A linear algorithm for embedding planar graphs using PQ-trees. Journal of Computer and System Sciences, 30:54-76, 1985.
3. G. Di Battista and E. Nardelli. Hierarchies and planarity theory. IEEE Transactions on systems, man, and cybernetics, 18(6):1035-1046, 1988.
4. L.S. Heath and S.V. Pemmaraju. 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, 1996a.
5. L.S. Heath and S.V. Pemmaraju. Stack and queue layouts of directed acyclic graphs: Part II. Technical report, Department of Computer Science, Virginia Polytechnic Institute & State University, 1996b.
6. M. Jünger, S. Leipert, and P. Mutzel. Pitfalls of using PQ-trees in Automatic Graph Drawing. In G. DiBattista, editor, Graph Drawing '97, volume 1353 of Lecture Notes in Computer Science, pages 193-204. Springer Verlag, 1997.