A FAST ALGORITHM FOR CONSTRUCTING TREES FROM DISTANCE MATRICES

被引：43

作者：

CULBERSON, JC

RUDNICKI, P

机构：

来源：

关键词：

D O I：

10.1016/0020-0190(89)90216-0

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：215 / 220

页数：6

共 7 条

[1] BOESCH FT, 1968, Q APPL MATH, V26, P607
[2] AN OPTIMAL DIAGONAL TREE CODE
CHAIKEN, S
DEWDNEY, AK
SLATER, PJ
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (01): : 42 - 49
[3] DISTANCE MATRIX OF A GRAPH AND ITS REALIZABILITY
HAKIMI, SL
YAU, SS
[J]. QUARTERLY OF APPLIED MATHEMATICS, 1965, 22 (04) : 305 - +
[4] Palmer E. M., 1985, GRAPHICAL EVOLUTION
[5] DISTANCE MATRIX OF A GRAPH AND ITS TREE REALIZATION
PATRINOS, AN
[J]. QUARTERLY OF APPLIED MATHEMATICS, 1972, 30 (03) : 255 - &
[6] SUBMATRICES OF NON-TREE-REALIZABLE DISTANCE MATRICES
SIMOESPEREIRA, JMS
ZAMFIRESCU, CM
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1982, 44 (APR) : 1 - 17
[7] Zaretskii KA., 1965, USP MAT NAUK, V20, P90