BROWSER FOR DIRECTED GRAPHS.

被引：0
|
作者：
Rowe, Lawrence A. [1 ]
Davis, Michael [1 ]
Messinger, Eli [1 ]
Meyer, Carl [1 ]
Spirakis, Charles [1 ]
Tuan, Allen [1 ]
机构：
[1] Univ of California, Berkeley, CA,, USA, Univ of California, Berkeley, CA, USA
来源：
Software - Practice and Experience | 1987年 / 17卷 / 01期
关键词：
COMPUTER PROGRAMMING - Algorithms - MATHEMATICAL TECHNIQUES - Graph Theory;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A general-purpose browser for directed graphs is described. The browser provides operations to examine and edit graphs and to generate a layout for a graph automatically that minimizes edge crossings. Two layout algorithms were implemented. A hierarchical graph layout algorithm was found to be best for directed graphs. The graph browser also has facilities that allow it to be integrated with other applications (e. g. a program browser). These facilities and our experiences building a program call-graph browser are described.
引用
收藏
页码：61 / 76
相关论文
共 50 条
  • [31] DEPTH PROBLEMS FOR FLOW GRAPHS.
    Hirata, Tomio
    Maruoka, Akira
    Kimura, Masayuki
    Systems, computers, controls, 1979, 10 (06): : 78 - 85
  • [32] Recognizable sets of graphs. A survey
    Courcelle, B.
    Words Languages and Combinatorics - Proceedings, 1992,
  • [33] NODE-GRACEFUL GRAPHS.
    Harary, Frank
    Hsu, D.Frank
    Computers & mathematics with applications, 1986, 15 (04): : 291 - 298
  • [34] CONNECTIONIST NETWORKS QUA GRAPHS.
    Partridge, D.
    Computers & mathematics with applications, 1986, 15 (04): : 325 - 331
  • [35] Cuts in Undirected Graphs. II
    F. Sharifov
    L. Hulianytskyi
    Cybernetics and Systems Analysis, 2020, 56 : 745 - 752
  • [36] Two-level quantum walkers on directed graphs. I. Universal quantum computing
    Asaka, Ryo
    Sakai, Kazumitsu
    Yahagi, Ryoko
    PHYSICAL REVIEW A, 2023, 107 (02)
  • [37] COPS AND ROBBERS IN GRAPHS WITH LARGE GIRTH AND CAYLEY GRAPHS.
    Frankl, Peter
    1600, (17):
  • [38] Parallel community detection for massive graphs.
    Riedy, E. Jason
    Meyerhenke, Henning
    Ediger, David
    Bader, David A.
    GRAPH PARTITIONING AND GRAPH CLUSTERING, 2013, 588 : 207 - +
  • [39] Virtual screening using reduced graphs.
    Gillet, VJ
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2004, 228 : U362 - U363
  • [40] Summing all the eikonal graphs. II
    H. M. Fried
    Y. Gabellini
    The European Physical Journal C - Particles and Fields, 2003, 32 : 55 - 65
12345