A linear time implementation of SPQR-trees

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

Volumn 1984, Issue , 2001, Pages 77-90

  Gutwenger, Carsten ^a   Mutzel, Petra ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DRAWING (GRAPHICS); FORESTRY;

GRAPH ALGORITHMS; HOPCROFT; IN-FIELD; LINEAR TIME; TARJAN ALGORITHMS;

TREES (MATHEMATICS);

EID: 84958530316     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44541-2_8     Document Type: Conference Paper

References (21)

1. AGD User Manual (Version 1.1.2), Feb 2000. Max-Planck-Institut Saarbrücken, Technische Universit¨at Wien, Universit¨at zu K¨oln, Universit¨at Trier. See also http://www.mpi-sb.mpg.de/AGD/.
2. G. Di Battista and R. Tamassia. On-line graph algorithms with SPQR-trees. In M. S. Paterson, editor, Proc. of the 17th International Colloqium on Automata, Languages and Prog ramming (ICALP), volume 443 of Lecture Notes in Computer Science, pages 598-611. Springer-Verlag, 1990.
3. P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. In Proc. 5th Workshop Algorithms, Data Struct., volume 1272 of Lecture Notes in Computer Science, pages 331-344, 1998.
4. P. Bertolazzi, G. Di Battista, G. Liotta, and C. Mannino. Optimal upward planarity testing of single-source digraphs. SIAM J. Comput., 27(1):132-169, 1998.
5. D. Bienstock and C. L. Monma. On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica, 5(1):93-109, 1990.
6. Elias Dahlhaus. A linear time algorithm to recognize clustered planar graphs and its parallelization. In C. L. Lucchesi and A. V. Moura, editors, LATIN '98: Theoretical Informatics, Third Latin American Symposium, volume 1380 of Lecture Notes in Computer Science, pages 239-248. Springer-Verlag, 1998.
7. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, and F. Vargiu. An experimental comparision of four graph drawing algorithms. Comput. Geom. Theory Appl., 7:303-326, 1997.
8. G. Di Battista and R. Tamassia. Incremental planarity testing. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 436-441, 1989.
9. G. Di Battista and R. Tamassia. On-line maintanance of triconnected components with SPQR-trees. Algorithmica, 15:302-318, 1996.
10. G. Di Battista and R. Tamassia. On-line planarity testing. SIAM J. Comput., 25(5):956-997, 1996.
11. W. Didimo. Dipartimento di Informatica e Automazione, Università di Roma Tre, Rome, Italy, Personal Communication.
12. GDToolkit Online Documentation. See http://www.dia.uniroma3.it/~gdt.
13. C. Gutwenger and P. Mutzel. A linear time implementation of SPQR-trees. Technical report, Technische Universit¨at Wien, 2000. To appear.
14. C. Gutwenger, P. Mutzel, and R. Weiskircher. Inserting an edge into a planar graph. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '01). ACM Press, 2001. To appear.
15. J. E. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM J. Comput., 2(3):135-158, 1973.
16. J. E. Hopcroft and R. E. Tarjan. Effcient planarity testing. Journal of the ACM, 21:549-568, 1974.
17. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, Special Issue on Graph Drawing, 16(1):4-32, 1996.
18. T. Lengauer. Hierarchical planarity testing. Journal of the ACM, 36:474-509, 1989.
19. S. MacLaine. A structural characterization of planar combinatorial graphs. Duke Math. J., 3:460-472, 1937.
20. K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999. to appear.
21. P. Mutzel and R. Weiskircher. Optimizing over all combinatorial embeddings of a planar graph. In G. Cornuéjols, R. Burkard, and G. Woeginger, editors, Proceedings of the Seventh Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 1610 of LNCS, pages 361-376. Springer Verlag, 1999