Recognition of Robinsonian dissimilarities
暂无分享,去创建一个
[1] P. Bertrand,et al. Propriétés et caractérisations topologiques d'une représentation pyramidale , 1992 .
[2] E. Diday. Croisements, ordres et ultramétriques , 1983 .
[3] Edwin Diday,et al. Orders and overlapping clusters by pyramids , 1987 .
[4] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[5] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[6] Carole Durand-Lepoivre. Ordres et graphes pseudo-hiérarchiques : théorie et optimisation algorithmique , 1989 .
[7] Lawrence Hubert,et al. SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES , 1974 .
[8] Boris Mirkin,et al. Mathematical Classification and Clustering , 1996 .
[9] Frank Critchley,et al. The partial order by inclusion of the principal classes of dissimilarity on a finite set, and some of their basic properties , 1994 .
[10] Gildas Brossier,et al. Représentation ordonnée des classifications hiérarchiques , 1980 .
[11] Sergey N. Rodin,et al. Graphs and Genes , 1984 .
[12] D. Kendall. Incidence matrices, interval graphs and seriation in archeology. , 1969 .
[13] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .
[14] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[15] W. S. Robinson. A Method for Chronologically Ordering Archaeological Deposits , 1951, American Antiquity.