THE COMPLEXITY OF DRAWING TREES NICELY

被引：43

作者：

SUPOWIT, KJ ^{[1
]}

REINGOLD, EM ^{[1
]}

机构：

[1] UNIV ILLINOIS,DEPT COMP SCI,URBANA,IL 61801

来源：

ACTA INFORMATICA | 1983年 / 18卷 / 04期

关键词：

D O I：

10.1007/BF00289576

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：377 / 392

页数：16

共 10 条

[1] BOUNDS ON POSITIVE INTEGRAL SOLUTIONS OF LINEAR DIOPHANTINE EQUATIONS [J].

BOROSH, I ;

TREYBIG, LB .

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 55 (02) :299-304

[2]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[3]

KHACHIYAN LG, 1979, DOKL AKAD NAUK SSSR, V244, P191

[4] NUMBERING SYSTEM FOR BINARY TREES [J].

KNOTT, GD .

COMMUNICATIONS OF THE ACM, 1977, 20 (02) :113-115

[5]

Knuth Donald E, 1968, ART COMPUTER PROGRAM, V1

[6]

Reingold E. M., 1977, COMBINATORIAL ALGORI

[7] TIDIER DRAWINGS OF TREES [J].

REINGOLD, EM ;

TILFORD, JS .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1981, 7 (02) :223-228

[8] P-COMPLETE APPROXIMATION PROBLEMS [J].

SAHNI, S ;

GONZALEZ, T .

JOURNAL OF THE ACM, 1976, 23 (03) :555-565

[9] PRETTY-PRINTING OF TREES [J].

VAUCHER, JG .

SOFTWARE-PRACTICE & EXPERIENCE, 1980, 10 (07) :553-561

[10]

WETHERELL C, 1979, IEEE T SOFTWARE ENG, V5, P514, DOI 10.1109/TSE.1979.234212

← 1 →