Recognition of Robinsonian dissimilarities

被引：20
|
作者：
Chepoi, V
机构：
[1] Lab. de Biomathématiques, Faculté de Médecine, Université d'Aix Marseille II, 13385 Marseille Cedex 5
[2] Universitatea de stat din Moldova, Chisinau
来源：
JOURNAL OF CLASSIFICATION | 1997年 / 14卷 / 02期
关键词：
Robinsonian dissimilarities; order compatible with a dissimilarity; divide-and-conquer algorithm;
D O I：
10.1007/s003579900015
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We present an O(n(3))-time, O(n(2))-space algorithm to test whether a dissimilarity d on an n-object set X is Robinsonian, i.e., X admits an ordering such that i less than or equal to j less than or equal to k implies that d(x(i),x(k)) greater than or equal to max {d(x(i),x(j)), d(x(j),x(k))}.
引用
收藏
页码：311 / 325
页数：15
相关论文
共 50 条
12345