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 条

[71] THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE [J].