An approximation algorithm for the two-layered graph drawing problem

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

Volumn 1627, Issue , 1999, Pages 81-91

  Yamaguchi, Atsuko ^a   Sugimoto, Akihiro ^a  

^a HITACHI LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; DRAWING (GRAPHICS); GRAPH THEORY; POLYNOMIAL APPROXIMATION;

APPROXIMATION RATIOS; BARYCENTER METHOD; EDGE CROSSING; LAYERED GRAPH DRAWING; LAYERED GRAPHS; MAXIMUM DEGREE; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; SPARSE GRAPHS;

APPROXIMATION ALGORITHMS;

EID: 84957811100     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48686-0_8     Document Type: Conference Paper

References (11)

1. C. Batini, L. Furlani, and E. Nardelli: What Is a Good Diagram?: A Pragmatic Approach, Proc. of the 4th International Conference on Entity-Relationship Approach, pp. 312-319, 1985.
2. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis: Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry, 4 (1994), pp. 235282.
3. T. Catarci: The Assignment Heuristic for Crossing Reduction, IEEE Transactions on Systems, Man, and Cybernetics, 25 (1995), 3, pp. 515-521.
4. P. Eades, B. D. McKay, and N. Wormald: On an Edge Crossing Problem, Proc. of the 9th Australian Computer Science Conference, pp. 327-334, 1986.
5. P. Eades and N. Wormald: Edge Crossings in Drawings of Bipartite Graphs, Algorithmica, 11 (1994), 4, pp. 379-403.
6. C. Esposito: Graph Graphics: Theory and Practice, Computers and Mathematics with Applications, 15 (1988), 4, pp. 247-253.
7. M. Jünger and P. Mutzel: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms, Journal of Graph Algorithms and Applications, 1 (1997), 1, pp. 1-25.
8. E. Makinen: Experiments on Drawing 2-level Hierarchical Graphs, International Journal of Computer Mathematics, 36 (1990), pp. 175-181.
9. H. C. Purchase, R. F. Cohen, and M. James: Validating Graph Drawing Aesthetics, Proc. of Symposium on Graph Drawing, GD’95 (Lecture Notes in Computer Science, Vol. 1027), pp. 435-446, Springer, 1996.
10. K. Sugiyama, S. Tagawa, and M. Toda: Methods for Visual Understanding of Hierarchical Systems, IEEE Transactions on Systems, Man, and Cybernetics, 11 (1981), 2, pp. 109-125.
11. A. Yamaguchi and A. Sugimoto: An Approximation Algorithm for the Two-layered Graph Drawing Problem, ARL Research Report, 98-001, 1999.