Skip to main content

Advertisement

SpringerLink
Log in

Genetic algorithms for the 2-page book drawing problem of graphs

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

The minimisation of edge crossings in a book drawing of a graph is one of the important goals for a linear VLSI design, and the 2-page crossing number of a graph provides an upper bound for the standard planar crossing number. We design genetic algorithms for the 2-page drawings, and test them on the benchmark test suits, Rome graphs and Random Connected Graphs. We also test some circulant graphs, and get better results than previously presented in the literature. Moreover, we formalise three conjectures for certain kinds of circulant graphs,supported by our experimental results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Barreto, A.M.S. and H.J.C. Barbosa. (2000). “Graph Layout Using a Genetic Algorithm.” In Proc. the VI Brazilian Symposium on Neural Networks (SBRN'00), pp. 179–184.

  • Cimikowski, R. (2002). “Algorithms for the Fixed Linear Crossing Number Problem.” Discrete Applied Mathematics 122, 93–115.

    Article  MATH  MathSciNet  Google Scholar 

  • Cimikowski, R. and P. Shope. (1996). “A Neural Network Algorithm for a Graph Layout Problem.” IEEE Trans. on Neural Networks 7(2), 341–346.

    Article  Google Scholar 

  • Eloranta, T. and E. Mäkinen. (2001). “Timga: A Genetic Algorithm for Drawing Undirected Graphs.” Divulg. Mat. 9(2), 155–170.

    MATH  MathSciNet  Google Scholar 

  • He, H., M.C. Newton, and O. Sýkora. (2005a). “Genetic Algorithms for Bipartite and Outerplanar Graph Drawings are Best!.” In Communications, SOFSEM'05, pp. 51–60.

  • He, H., O. Sykora, and I. Vrt'o. (2005b). “Heuristic Crossing Minimisation Algorithms for 2-page Drawings(Extended Abstract).” In Proc. ICGT'05. The Electronic Notes in Discrete Mathematics (ENDM), vol. 22.

  • Huang, J.W. and L.S. Kang. (1998). “A Graph Drawing Algorithm for General Undirected Graphs Based on Genetic Algorithms.” J. Math. (Wuhan) 18(suppl.), 68–72.

    MATH  MathSciNet  Google Scholar 

  • Lin, X., Y. Yang, J. Lŭ, and X. Hao. (2005). “The Crossing Number of c(mκ1,κ).” Graphs and Combinatorics 21(1), 89–96.

    Article  MATH  MathSciNet  Google Scholar 

  • Masuda, S., T. Kashiwabara, K. Nakajima, and T. Fujisawa. (1990). “Crossing Minimization in Linear Embeddings of Graphs.” IEEE Trans. Comput. 39, 124–127.

    Article  MathSciNet  Google Scholar 

  • Michalewicz, Z. (1994). “Genetic Algorithms + Data Structures = Evolution Programs.” second, extended edition edn, Springer.

  • Radwan, A.A. and M.A. El-Sayed. (2004). “Using Genetic Algorithm for Drawing Triangulated Planar Graphs.” J. Inst. Math. Comput. Sci., Comput. Sci. Ser. 15(1), 137–147.

    MathSciNet  Google Scholar 

  • Shahrokhi, F., O. Sýkora, L. Székely, and I. Vrt'o. (1996). “The Book Crossing Number of a Graph.” Journal of Graph Theory 21, 413–424.

    Article  MATH  MathSciNet  Google Scholar 

  • Winterbach, W. (2005). “The Crossing Number of a Graph in the Plane.” Master's thesis, Dept. Appl. Math, University of Stellenbosch, SA.

  • Yang, Y. and C. Zhao. (2001). “The Crossing Number of Cn(1,κ).” In Proc. National Symposium on Software Technology, Chinese Computer Institute, pp. 134–136.

  • GDToolKit: http://www.dia.uniroma3.it/ gdt/.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Loughborough University Loughborough, Leicestershire, LE11 3TU, The United Kingdom

    Hongmei He & Ondrej Sýkora

  2. Department of Computer Sciences, University of Tampere, P.O. Box 607, FIN-33014, Tampere, Finland

    Erkki Mäkinen

Authors
  1. Hongmei He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ondrej Sýkora
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Erkki Mäkinen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hongmei He.

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, H., Sýkora, O. & Mäkinen, E. Genetic algorithms for the 2-page book drawing problem of graphs. J Heuristics 13, 77–93 (2007). https://doi.org/10.1007/s10732-006-9000-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-006-9000-4

Keywords

Search

Navigation