Simple and efficient bilayer cross counting

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

Volumn 2528 LNCS, Issue , 2002, Pages 130-141

  Barth, Wilhelm ^a   Jünger, Michael ^b   Mutzel, Petra ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); ALGORITHMS;

BIPARTITE GRAPHS; CARDINALITIES; COMPUTATIONAL EXPERIMENT; DISTINCT POINTS; EDGE CROSSING; LAYERED GRAPH DRAWING; PARALLEL LINE; STRAIGHT-LINE SEGMENTS;

GRAPH THEORY;

EID: 84867438673     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36151-0_13     Document Type: Conference Paper

References (12)

1. B. Chazelle, Reporting and counting segment intersections. Journal of Computer and System Sciences 32 (1986) 156-182.
2. B. Chazelle and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane. Journal of the ACM 39 (1992) 1-54.
3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms. MIT Press, Cambridge, MA, 1990.
4. P. Eades and N. Wormald, Edge crossings in drawings of bipartite graphs. Algorithmica 11 (1994) 379-403.
5. C. Gutwenger, M. Jünger, G. W. Klau, S. Leipert, and P. Mutzel, Graph Drawing Algorithm Engineering with AGD. in: S. Diehl (ed.), Software Visualization, International Dagstuhl Seminar on Software Visualization 2001, Lecture Notes in Computer Science 2269, Springer, 2002, pp. 307-323, see also: http://www.mpi-sb.mpg.de/AGD/
6. M. Jünger and P. Mutzel, 2-layer straight line crossing minimization: performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications 1 (1997) 1-25.
7. D. E. Knuth, The Stanford GraphBase: A platform for combinatorial computing. Addison-Wesley, Reading, Massachusetts, 1993
8. G. S. Lueker, A data structure for orthogonal range queries. Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, 1978, pp. 28-34.
9. G. Sander, Graph Layout through the VCG Tool. in: R. Tamassia and I. G. Tollis (eds): Graph Drawing 1994, Lecture Notes in Computer Science 894, Springer, 1995, pp. 194-205, see also: http://rw4.cs.uni-sb.de/users/sander/ html/gsvcg1.html
10. G. Sander, Visualisierungstechniken für den Compilerbau. Pirrot Verlag & Druck, Saarbrücken, 1996.
11. K. Sugiyama, S. Tagawa, and M. Toda, Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics 11 (1981) 109-125.
12. V. Waddle and A. Malhotra, An E log E line crossing algorithm for levelled graphs. in: J. Kratochvíl (ed.) Graph Drawing 1999, Lecture Notes in Computer Science 1731, Springer, 1999, pp. 59-70.