GRAPHS THAT ARE ALMOST BINARY-TREES

被引:14
作者
HONG, JW [1 ]
ROSENBERG, AL [1 ]
机构
[1] IBM CORP, THOMAS J WATSON RES CTR, DEPT MATH SCI, YORKTOWN HTS, NY 10598 USA
关键词
D O I
10.1137/0211018
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:227 / 242
页数:16
相关论文
共 12 条
[1]   PRESERVING AVERAGE PROXIMITY IN ARRAYS [J].
DEMILLO, RA ;
EISENSTAT, SC ;
LIPTON, RJ .
COMMUNICATIONS OF THE ACM, 1978, 21 (03) :228-231
[2]  
Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1
[3]  
Knuth Donald E, 1968, ART COMPUTER PROGRAM, V1
[4]  
Kung H. T., 1977, High Speed Computer and Algorithm Organization, P423
[5]  
Lipton R. J., 1977, 18th Annual Symposium on Foundations of Computer Science, P162, DOI 10.1109/SFCS.1977.6
[6]   SPACE AND TIME HIERARCHIES FOR CLASSES OF CONTROL STRUCTURES AND DATA-STRUCTURES [J].
LIPTON, RJ ;
EISENSTAT, SC ;
DEMILLO, RA .
JOURNAL OF THE ACM, 1976, 23 (04) :720-732
[7]  
Rosenberg A. L., 1975, SIAM Journal on Computing, V4, P443, DOI 10.1137/0204038
[8]   DATA ENCODINGS AND THEIR COSTS [J].
ROSENBERG, AL .
ACTA INFORMATICA, 1978, 9 (03) :273-292
[9]   STORAGE REPRESENTATIONS FOR TREE-LIKE DATA-STRUCTURES [J].
ROSENBERG, AL ;
WOOD, D ;
GALIL, Z .
MATHEMATICAL SYSTEMS THEORY, 1979, 13 (02) :105-130
[10]   ENCODING DATA-STRUCTURES IN TREES [J].
ROSENBERG, AL .
JOURNAL OF THE ACM, 1979, 26 (04) :668-689