Crossing reduction in circular layouts

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

Volumn 3353, Issue , 2004, Pages 332-343

  Baur, Michael ^a   Brandes, Ulrik ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

% REDUCTIONS; GENERALISATION; GREEDY POLICY; LOCAL OPTIMIZATIONS; SECOND PHASE; SIMPLE++; TWO PHASE;

ARTIFICIAL INTELLIGENCE; GRAPH THEORY;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 35048896978     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30559-0_28     Document Type: Article

References (14)

1. M. Baur and U. Brandes. Crossing reduction in circular layouts. Technical Report 2004-14, Universität Karlsruhe (TH), Fakultät für Informatik, August 2004
2. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications, 7:303-326, 1997.
3. U. Doǧrusöz, B. Madden, and P. Madden. Circular layout in the Graph Layout Toolkit. Proc. 4th Intl. Symp. Graph Drawing (GD '96), LNCS 1190:92-100. Springer, 1996
4. P. Eades and D. Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria, 21(A):89-98, 1986.
5. P. Eades and N. C. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11:379-403, 1994.
6. H. He and O. Sýkora. New circular drawing algorithms. Unpublished manuscript.
7. E. Mäkinen. On circular layouts. International Journal of Computer Mathematics, 24:29-37, 1988.
8. S. Masuda, T. Kashiwabara, K. Nakajima, and T. Fujisawa. On the NP-completeness of a computer network layout problem. Proc. IEEE Intl. Symp. Circuits and Systems, pages 292-295, 1987.
9. C. Matuszewski, R. Schönfeld, and P. Molitor. Using sifting for k-layer straight-line crossing minimization. Proc. 7th Intl. Symp. Graph Drawing (GD '99), LNCS 1731:217-224. Springer, 1999.
10. K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
11. S. L. Mitchell. Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Information Processing Letters, 9(5):229-232, 1979.
12. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. Proc. IEEE Intl. Conf. Computer Aided Design (ICCAD '93), pages 42-47, 1993.
13. P. Shahrokhi, O. Sýkora, László,L. A. Székely, I. Vrto. Book embeddings and crossing numbers. Proc. 20th Workshop on Graph-Theoretic Concepts in Computer Science, WG '94, LNCS 903:256-268, Springer, 1995.
14. J. M. Six and I. G. Tollis. Circular drawings of biconnected graphs. Proc. 1st Workshop Algorithm Engineering and Experimentation (ALENEX '99), LNCS 1619:57-73. Springer, 1999.