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

被引：0
|
作者：
Hongmei He
Ondrej Sýkora
Erkki Mäkinen
机构：
[1] Loughborough University Loughborough,Department of Computer Science
[2] University of Tampere,Department of Computer Sciences
来源：
Journal of Heuristics | 2007年 / 13卷
关键词：
Genetic algorithms; 2-page crossing number; Hamiltonian cycle; Order of vertices; Edge distribution; Optimal values;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：77 / 93
页数：16
相关论文
共 50 条
  • [1] Genetic algorithms for the 2-page book drawing problem of graphs
    He, Hongmei
    Sykora, Ondrej
    Makinen, Erkki
    JOURNAL OF HEURISTICS, 2007, 13 (01) : 77 - 93
  • [2] Various island-based parallel genetic algorithms for the 2-page drawing problem
    He, HM
    Sykora, O
    Salagean, A
    PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING AND NETWORKS, 2006, : 316 - +
  • [3] Parallelisation of genetic algorithms for the 2-page crossing number problem
    He, Hongmei
    Sykora, Ondrej
    Salagean, Ana
    Makinen, Erkki
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2007, 67 (02) : 229 - 241
  • [4] An evolutionary algorithm for the 2-page crossing number problem
    Bansal, Richa
    Srivastava, Kamal
    Shweta
    Varshney, Kirti
    Sharma, Nidhi
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 1095 - 1102
  • [5] Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
    Bannister, Michael J.
    Eppstein, David
    GRAPH DRAWING (GD 2014), 2014, 8871 : 210 - 221
  • [6] Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
    Bannister M.J.
    Eppstein D.
    Journal of Graph Algorithms and Applications, 2018, 22 (04) : 577 - 606
  • [7] Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
    Bannister, Michael J., 1600, Springer Verlag (8871):
  • [8] Drawing undirected graphs with genetic algorithms
    Zhang, QG
    Liu, HY
    Zhang, W
    Guo, YJ
    ADVANCES IN NATURAL COMPUTATION, PT 3, PROCEEDINGS, 2005, 3612 : 28 - 36
  • [9] GENETIC ALGORITHMS FOR DRAWING BIPARTITE GRAPHS
    MAKINEN, E
    SIERANTA, M
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1994, 53 (3-4) : 157 - 166
  • [10] THE 2-PAGE ESSAY
    FINKELSTEIN, J
    SOCIAL EDUCATION, 1962, 26 (06) : 301 - 302
12345