STRAIGHT-LINE REPRESENTATIONS OF INFINITE PLANAR GRAPHS

被引:0
|
作者
THOMASSEN, C
机构
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:411 / 423
页数:13
相关论文
共 50 条
  • [21] An exact algorithm for disaster-resilience augmentation of planar straight-line graphs
    Westcott, Alexander
    Ras, Charl
    JOURNAL OF GLOBAL OPTIMIZATION, 2025,
  • [22] Straight-Line Rectangular Drawings of Clustered Graphs
    Angelini, Patrizio
    Frati, Fabrizio
    Kaufmann, Michael
    ALGORITHMS AND DATA STRUCTURES, 2009, 5664 : 25 - +
  • [23] Straight-Line Rectangular Drawings of Clustered Graphs
    Angelini, Patrizio
    Frati, Fabrizio
    Kaufmann, Michael
    DISCRETE & COMPUTATIONAL GEOMETRY, 2011, 45 (01) : 88 - 140
  • [24] Area-Thickness Trade-Offs for Straight-Line Drawings of Planar Graphs
    Di Giacomo, Emilio
    Didimo, Walter
    Liotta, Giuseppe
    Montecchiani, Fabrizio
    COMPUTER JOURNAL, 2017, 60 (01): : 135 - 142
  • [25] Straight-Line Rectangular Drawings of Clustered Graphs
    Patrizio Angelini
    Fabrizio Frati
    Michael Kaufmann
    Discrete & Computational Geometry, 2011, 45 : 88 - 140
  • [26] Searching for undiscovered planar straight-line linkages
    Luo, Zhenjun
    Dai, Jian S.
    ADVANCES IN ROBOT KINEMATICS: MECHANISMS AND MOTION, 2006, : 113 - +
  • [27] A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs
    Hong, SH
    Eades, P
    GRAPH DRAWING, 2004, 3383 : 307 - 317
  • [28] Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
    Peter Eades
    Qingwen Feng
    Xuemin Lin
    Hiroshi Nagamochi
    Algorithmica, 2006, 44 : 1 - 32
  • [29] Straight-line drawing algorithms for hierarchical graphs and clustered graphs
    Eades, P
    Feng, QW
    Lin, XM
    Nagamochi, H
    ALGORITHMICA, 2006, 44 (01) : 1 - 32
  • [30] ALGORITHM FOR A STRAIGHT-LINE REPRESENTATION OF PLANAR GRAPHS AND ITS APPLICATION TO PERT-TYPE NETWORKS
    SOUKUP, J
    SIAM REVIEW, 1976, 18 (04) : 828 - 828