Meta heuristic for graph drawing. Learning the optimal graph-drawing method for clustered graphs

被引：0
|
作者：
机构：
[1] Niggemann, Oliver
[2] Stein, Benno
来源：
Niggemann, Oliver | 2000年 / ACM, New York, NY, United States卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Graph-drawing contest report
    Eades, P
    Marks, J
    Mutzel, P
    North, S
    [J]. GRAPH DRAWING, 1998, 1547 : 423 - 435
  • [2] Graph-drawing contest report
    Eades, P
    Marks, J
    [J]. GRAPH DRAWING, 1996, 1027 : 224 - 233
  • [3] Graph-drawing contest report
    Brandenburg, FJ
    Junger, M
    Marks, J
    Mutzel, P
    Schreiber, F
    [J]. GRAPH DRAWING, 1999, 1731 : 400 - 409
  • [4] Graph-drawing contest report
    Duncan, Christian A.
    Klau, Gunnar
    Kobourov, Stephen G.
    Sander, Georg
    [J]. GRAPH DRAWING, 2007, 4372 : 448 - +
  • [5] Graph-drawing contest report
    Biedl, T
    Brandenburg, FJ
    [J]. GRAPH DRAWING, 2002, 2265 : 513 - 521
  • [6] Graph-drawing contest report
    Brandenburg, FJ
    Duncan, CA
    Gansner, ER
    Kobourov, SG
    [J]. GRAPH DRAWING, 2004, 3383 : 512 - 516
  • [7] Graph-drawing contest report
    Duncan, CA
    Kobourov, SG
    Wagner, D
    [J]. GRAPH DRAWING, 2006, 3843 : 528 - 531
  • [8] USE OF A GENERAL GRAPH-DRAWING ALGORITHM IN THE CONSTRUCTION OF ASSOCIATION MAPS
    CRAVEN, TC
    [J]. PROCEEDINGS OF THE ASIS ANNUAL MEETING, 1992, 29 : 32 - 40
  • [9] Graph-drawing algorithms geometries versus molecular mechanics in fullerenes
    Kaufman, M
    Pisanski, T
    Lukman, D
    Borstnik, B
    Graovac, A
    [J]. CHEMICAL PHYSICS LETTERS, 1996, 259 (3-4) : 420 - 424
  • [10] The DFS-heuristic for orthogonal graph drawing
    Biedl, T
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2001, 18 (03): : 167 - 188
12345