Using graph parsing for automatic graph drawing

被引:3
|
作者
McCreary, CL [1 ]
Chapman, RO
Shieh, FS
机构
[1] Tufts Univ, Medford, MA 02155 USA
[2] Auburn Univ, Dept Comp Sci & Engn, Auburn, AL 36849 USA
关键词
D O I
10.1109/3468.709599
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a procedure for automatically drawing directed graphs. Our system, Clan-based Graph Drawing Tool (CG), uses a unique clan-based graph decomposition to determine intrinsic substructures (clans) in the graph and to produce a parse tree. The tree is given attributes that specify the node layout, CG then uses tree properties with the addition of "routing nodes" to route the edges. The objective of the system is to provide, automatically, an aesthetically pleasing visual layout for arbitrary directed graphs. The prototype has shown the strengths of this approach. The innovative strategy of dan-based graph decomposition is the first digraph drawing technique to analyze locality in the graph in two dimensions. The typical approach to drawing digraphs uses a single dimension, level, to arrange the nodes.
引用
收藏
页码:545 / 561
页数:17
相关论文
共 50 条
  • [31] A Semi-Autoregressive Graph Generative Model for Dependency Graph Parsing
    Ma, Ye
    Sun, Mingming
    Li, Ping
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, ACL 2023, 2023, : 4218 - 4230
  • [32] Graph-to-Graph Transformer for Transition-based Dependency Parsing
    Mohammadshahi, Alireza
    Henderson, James
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, EMNLP 2020, 2020,
  • [33] Drawing clustered Graph using modular decomposition tree
    Deng, W.-Y., 1600, Asian Network for Scientific Information (12):
  • [34] Contextualized Trajectory Parsing with Spatiotemporal Graph
    Liu, Xiaobai
    Lin, Liang
    Jin, Hai
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (12) : 3010 - 3024
  • [35] Incorporating EDS Graph for AMR Parsing
    Shou, Ziyi
    Lin, Fangzhen
    10TH CONFERENCE ON LEXICAL AND COMPUTATIONAL SEMANTICS (SEM 2021), 2021, : 202 - 211
  • [36] Cache Transition Systems for Graph Parsing
    Gildea, Daniel
    Satta, Giorgio
    Peng, Xiaochang
    COMPUTATIONAL LINGUISTICS, 2018, 44 (01) : 85 - 118
  • [37] Improvement of Fuzzy Graph Drawing Using Partition Tree
    Shiono, Yasunori
    Yoshizumi, Toshihiro
    Tsuchida, Kensei
    JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS, 2022, 26 (01) : 17 - 22
  • [38] Ensembling Graph Predictions for AMR Parsing
    Lam, Hoang Thanh
    Picco, Gabriele
    Hou, Yufang
    Lee, Young-Suk
    Nguyen, Lam M.
    Phan, Dzung T.
    Lopez, Vanessa
    Astudillo, Ramon Fernandez
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [39] SDE: Graph drawing using spectral distance embedding
    Civril, A
    Magdon-Ismail, M
    Bocek-Rivele, E
    GRAPH DRAWING, 2006, 3843 : 512 - 513
  • [40] PARSING OF GRAPH-REPRESENTABLE PICTURES
    SHAW, AC
    JOURNAL OF THE ACM, 1970, 17 (03) : 453 - &