AN OPTIMAL DIAGONAL TREE CODE

被引：11

作者：

CHAIKEN, S

DEWDNEY, AK

SLATER, PJ

机构：

[1] UNIV WESTERN ONTARIO,DEPT COMP SCI,LONDON N6A 5B9,ONTARIO,CANADA

[2] SANDIA NATL LABS,DIV APPL MATH,ALBUQUERQUE,NM 87185

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1983年 / 4卷 / 01期

关键词：

D O I：

10.1137/0604006

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：42 / 49

页数：8

共 8 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] DIAGONAL TREE CODES [J].

DEWDNEY, AK .

INFORMATION AND CONTROL, 1979, 40 (02) :234-239

[3]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[4] DISTANCE MATRIX OF A GRAPH AND ITS TREE REALIZATION [J].

PATRINOS, AN .

[5]

READ RC, 1972, CODING VARIOUS KINDS

[6]

SMOLENSKII YA, 1963, USSR COMP MATH MATH, V2, P396, DOI 10.1016/0041-5553(63

[7]

Wilson RJ., 1972, INTRO GRAPH THEORY

[8]

Zaretskii KA., 1965, USP MAT NAUK, V20, P90