Bimodal crossing minimization

被引:0
|
作者
Buchheim, Christoph [1 ]
Juenger, Michael [1 ]
Menze, Annette [1 ]
Percan, Merijam [1 ]
机构
[1] Univ Cologne, Inst Informat, D-50969 Cologne, Germany
来源
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We consider the problem of drawing a directed graph in two dimensions with a minimum number of crossings such that for every node the incoming edges appear consecutively in the cyclic adjacency lists. We show how to adapt the planarization method and the recently devised exact crossing minimization approach in a simple way. We report experimental results on the increase in the number of crossings involved by this additional restriction on the set of feasible drawings. It turns out that this increase is negligible for most practical instances.
引用
收藏
页码:497 / 506
页数:10
相关论文
共 50 条
  • [1] On crossing minimization problem
    Chen, HFS
    Lee, DT
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1998, 17 (05) : 406 - 418
  • [2] Exact crossing minimization
    Buchheim, C
    Ebner, D
    Jünger, M
    Klau, GW
    Mutzel, P
    Weiskircher, R
    [J]. GRAPH DRAWING, 2006, 3843 : 37 - 48
  • [3] Crossing minimization for symmetries
    Buchheim, C
    Hong, SH
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 563 - 574
  • [4] Crossing Minimization for Symmetries
    Christoph Buchheim
    Seok-Hee Hong
    [J]. Theory of Computing Systems, 2005, 38 : 293 - 311
  • [5] Crossing minimization for symmetries
    Buchheim, C
    Hong, SH
    [J]. THEORY OF COMPUTING SYSTEMS, 2005, 38 (03) : 293 - 311
  • [6] Crossing minimization in perturbed drawings
    Fulek, Radoslav
    Toth, Csaba D.
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 40 (02) : 279 - 302
  • [7] The constrained crossing minimization problem
    Mutzel, P
    Ziegler, T
    [J]. GRAPH DRAWING, 1999, 1731 : 175 - 185
  • [8] Crossing Minimization in Storyline Visualization
    Gronemann, Martin
    Juenger, Michael
    Liers, Frauke
    Mambelli, Francesco
    [J]. GRAPH DRAWING AND NETWORK VISUALIZATION (GD 2016), 2016, 9801 : 367 - 381
  • [9] Crossing minimization in perturbed drawings
    Radoslav Fulek
    Csaba D. Tóth
    [J]. Journal of Combinatorial Optimization, 2020, 40 : 279 - 302
  • [10] Crossing Minimization in Perturbed Drawings
    Fulek, Radoslav
    Toth, Csaba D.
    [J]. GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2018, 2018, 11282 : 229 - 241