Radial level planarity testing and embedding in linear time

Journal of Graph Algorithms and Applications

Volumn 9, Issue 1, 2005, Pages 53-97

  Bachmaier, Christian ^a   Brandenburg, Frunz J ^a   Forster, Michael ^b  

^a UNIVERSITY OF PASSAU   (Germany)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26844476181     PISSN: 15261719     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00100     Document Type: Conference Paper

References (35)

1. C. Bachmaier. Circle Planarity of Level Graphs. Dissertation, University of Passau, 2004.
2. C. Bachmaier, F. J. Brandenburg, and M. Forster. Track planarity testing and embedding. In P. Van Emde Boas, J. Pokorný, M. Bieliková, and J. Štuller, editors, Proc. Software Seminar: Theory and Practice of Informatics, SOFSEM 2004, volume 2, pages 9-17. MatFyzPres, 2004.
3. C. Bachmaier, F. Fischer, and M. Forster. Radial coordinate assignment for level graphs. In L. Wang, editor, Proc. Computing and Combinatorics, COCOON 2005, volume 3595 of LNCS, pages 401-410. Springer, 2005.
4. C. Bachmaier and M. Raitner. Improved symmetric lists. Technical Report MIP-0409, University of Passau, October 2004.
5. K. S. Booth and G. S. 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.
6. U. Brandes, P. Kenis, and D. Wagner. Centrality in policy network drawings. In J. Kratochvíl, editor, Proc. Graph Drawing 1999, volume 1731 of LNCS, pages 250-258. Springer, 1999.
7. U. Brandes, P. Kenis, and D. Wagner. Communicating centrality in policy network drawings. IEEE Transactions on Visualization and Computer Graphics, 9(2):241-253, 2003.
8. M. Chandramouli and A. A. Diwan. Upward numbering testing for triconnected graphs. In F. J. Brandenburg, editor, Proc. Graph Drawing 1995, volume 1027 of LNCS, pages 140-151. Springer, 1996.
9. 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.
10. H. de Fraysseix, J. Pach, and R. Pollack. Small sets supporting Fáry embeddings of planar graphs. In Proc. ACM Symposium, on Theory of Computing, STOC 1988, pages 426-433. ACM Press, 1988.
11. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1990.
12. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
13. G. Di Battista and E. Nardelli. Hierarchies and planarity theory. IEEE Transactions on Systems, Man, and Cybernetics, 18(6):1035-1046, 1988.
14. G. Di Battista and R. Tamassia. On-line planarity testing. SIAM Journal on Computing, 25(5):956-997, 1996.
15. V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, and D. R. Wood. On the parameterized complexity of layered graph drawing. In F. Meyer auf der Heide, editor, Proc. European Symposium on Algorithms 2001, volume 2161 of LNCS, pages 488-499. Springer, 2001.
16. P. Eades. Drawing free trees. Bulletin of the Institute of Combinatorics and its Applications, 5:10-36, 1992.
17. S. Even. Algorithms, chapter 7, pages 148-191. Computer Science Press, 1979.
18. P. Healy and A. Kuusik. The vertex-exchange graph: A new concept for multi-level crossing minimisation. In J. Kratochvíl, editor, Proc. Graph Drawing 1999, volume 1731 of LNCS, pages 205-216. Springer, 1999.
19. P. Healy, A. Kuusik, and S. Leipert. Characterization of level non-planar graphs by minimal patterns. In D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, and A. Sharma, editors, Proc. Computing and Combinatorics, CO-COON 2000, volume 1858 of LNCS, pages 74-84. Springer, 2000.
20. L. S. Heath and S. V. Pemmaraju. Recognizing leveled-planar dags in linear time. InF. J. Brandenburg, editor, Proc. Graph Drawing 1995, volume 1027 of LNCS, pages 300-311. Springer, 1996.
21. L. S. Heath and S. V. Pemmaraju. Stack and queue layouts of directed acyclic graphs: Part II. SIAM Journal on Computing, 28(5):1588-1626, 1999.
22. L. S. Heath and A. L. Rosenberg. Laying out graphs using queues. SIAM Journal on Computing, 21(5):927-958, 1992.
23. C. Hundack, P. Mutzel, I. Pouchkarev, and S. Thome. ArchE: A graph drawing system for archeology. In G. Di Battista, editor, Proc. Graph Drawing 1997, volume 1353 of LNCS, pages 297-302. Springer, 1998.
24. M. Jünger and S. Leipert. Level planar embedding in linear time. In J. Kratochvíl, editor, Proc. Graph Drawing 1999, volume 1731 of LNCS, pages 72-81. Springer, 1999.
25. M. Jünger and S. Leipert. Level planar embedding in linear time. Journal of Graph Algorithms and Applications, 6(1):67-113, 2002.
26. M. Jünger, S. Leipert, and P. Mutzel. Level planarity testing in linear time. In S. H. Whitesides, editor, Proc. Graph Drawing 1998, volume 1547 of LNCS, pages 224-237. Springer, 1998.
27. A. Karaberg. Classification and detection of obstructions to planarity. Linear and Multilinear Algebra, 26:15-38, 1990.
28. S. Leipert. Level Planarity Testing and Embedding in Linear Time. Dissertation, Mathematisch-Naturwissenschaftliche Fakultät der Universität zu Köln, 1998.
29. A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In P. Rosenstiehl, editor, Proc. of Theory of Graphs, International Symposium, Rome, pages 215-232. Gordon and Breach, 1967.
30. K. Mehlhorn and S. Näher. LEDA, A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
31. H. C. Purchase. Which aesthetic has the greatest effect on human understanding? In G. Di Battista, editor, Proc. Graph Drawing 1997, volume 1353 of LNCS, pages 248-261. Springer, 1997.
32. B. Randerath, E. Speckenmeyer, E. Boros, P. Hammer, A. Kogan, K. Makino, B. Simeone, and O. Cepek. A satisfiability formulation of problems on level graphs. Rutcor Research Report RRR 40-2001, Rutgers Center for Operations Research, Rutgers University, 2001.
33. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics, 11(2):109-125, 1981.
34. J. D. Ullman. Computational Aspects of VLSI, chapter 3.5, pages 111-114. Computer Science Press, 1984.
35. S. G. Williamson. Depth-first search and Kuratowski subgraphs. Journal of the ACM, 31(4):681-693, 1984.