Abstract
We present a polynomial-time approximation algorithm for the minimum edge crossings problem for two-layered graphs. We show the relationship between the approximation ratio of our algorithm and the maximum degree of the vertices in the lower layer of the input graph. When the maximum degree is not greater than four, the approximation ratio is two and this ratio monotonically increases to three as the maximum degree becomes larger. We also present our experiments, showing that our algorithm constructs better solutions than the barycenter method and the median method for dense graphs as well as sparse graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis: Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry, 4 (1994), pp. 235–282.
T. Catarci: The Assignment Heuristic for Crossing Reduction, IEEE Transactions on Systems, Man, and Cybernetics, 25 (1995), 3, pp. 515–521.
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.
P. Eades and N. Wormald: Edge Crossings in Drawings of Bipartite Graphs, Algorithmica, 11 (1994), 4, pp. 379–403.
C. Esposito: Graph Graphics: Theory and Practice, Computers and Mathematics with Applications, 15 (1988), 4, pp. 247–253.
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.
E. Mäkinen: Experiments on Drawing 2-level Hierarchical Graphs, International Journal of Computer Mathematics, 36 (1990), pp. 175–181.
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.
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.
A. Yamaguchi and A. Sugimoto: An Approximation Algorithm for the Two-layered Graph Drawing Problem, ARL Research Report, 98-001, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamaguchi, A., Sugimoto, A. (1999). An Approximation Algorithm for the Two-Layered Graph Drawing Problem. In: Asano, T., Imai, H., Lee, D.T., Nakano, Si., Tokuyama, T. (eds) Computing and Combinatorics. COCOON 1999. Lecture Notes in Computer Science, vol 1627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48686-0_8
Download citation
DOI: https://doi.org/10.1007/3-540-48686-0_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66200-6
Online ISBN: 978-3-540-48686-2
eBook Packages: Springer Book Archive