学术探索
学术期刊
新闻热点
数据分析
智能评审

ALGORITHMS FOR DRAWING GRAPHS - AN ANNOTATED-BIBLIOGRAPHY

被引：360
作者：
DIBATTISTA, G
EADES, P
TAMASSIA, R
TOLLIS, IG
机构：
[1] UNIV ROMA LA SAPIENZA, DIPARTIMENTO INFORMAT & SISTEMIST, I-00198 ROME, ITALY
[2] UNIV NEWCASTLE, DEPT COMP SCI, NEWCASTLE, NSW 2308, AUSTRALIA
[3] UNIV TEXAS, DEPT COMP SCI, RICHARDSON, TX 75083 USA
[4] BROWN UNIV, DEPT COMP SCI, PROVIDENCE, RI 02912 USA
来源：
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 1994年 / 4卷 / 05期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1016/0925-7721(94)00014-X
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Several data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and software engineering diagrams. In this paper we present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs. Research on this topic is spread over the broad spectrum of Computer Science. This bibliography constitutes an attempt to encompass both theoretical and application oriented papers from disparate areas.
引用
收藏
页码：235 / 282
页数：48
相关论文
共 303 条
[41]  
EADES P, 1982, LECT NOTES MATH, V952, P239
[42]  
Eades P., 1990, Journal of Information Processing, V13, P424
[43]  
EADES P, 1986, ARS COMBINATORIA A, V21, P89
[44]  
EADES PD, 1992, B I COMBINATORICS IT, V5, P10
[45]   TWO TREE DRAWING CONVENTIONS [J].
Eades, Peter ;
Lin, Tao ;
Lin, Xuemin .
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1993, 3 (02) :133-153
[46]  
EGGLETON RB, 1986, UTILITAS MATHEMATICA, V29, P149
[47]  
Eppstein D., 1993, Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, P208, DOI 10.1145/167088.167159
[48]   GRAPH GRAPHICS - THEORY AND PRACTICE [J].
ESPOSITO, C .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1988, 15 (04) :247-253
[49]  
Even S., 1976, Theoretical Computer Science, V2, P339, DOI 10.1016/0304-3975(76)90086-4
[50]  
EVEN S., 1979, GRAPH ALGORITHMS
12345678910