A NOTE ON OPTIMAL AND SUBOPTIMAL DIGRAPH REALIZATIONS OF QUASIDISTANCE MATRICES

被引：11

作者：

SIMOESPEREIRA, JMS ^{[1
]}

机构：

[1] CUNY,GRAD SCH,NEW YORK,NY 10021

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1984年 / 5卷 / 01期

关键词：

D O I：

10.1137/0605014

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：117 / 132

页数：16

共 20 条

[1]

BOESCH FT, 1968, Q APPL MATH, V26, P607

[2]

Buneman P., 1974, J COMBINATORIAL TH B, V17, P48, DOI 10.1016/0095-8956(74)90047-1

[3] AN OPTIMAL DIAGONAL TREE CODE [J].

CHAIKEN, S ;

DEWDNEY, AK ;

SLATER, PJ .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (01) :42-49

[4] DIAGONAL TREE CODES [J].

DEWDNEY, AK .

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

[5]

DRESS A, UNPUB CHARACTERIZATI

[6] THE ORIGIN OF GENETIC INFORMATION [J].

EIGEN, M ;

GARDINER, W ;

SCHUSTER, P ;

WINKLEROSWATITSCH, R .

SCIENTIFIC AMERICAN, 1981, 244 (04) :88-&

[7] DISTANCE MATRIX OF A GRAPH AND ITS REALIZABILITY [J].

HAKIMI, SL ;

YAU, SS .

QUARTERLY OF APPLIED MATHEMATICS, 1965, 22 (04) :305-+

[8]

IMRICH W, 1969, SITZUNGSBERICHTEN 2, V178, P19

[9]

IMRICH W, UNPUB ANN DISCR MATH

[10]

Imrich W, 1972, SIBERIAN MATH J, V13, P558

← 1 2 →