Recognition of Robinsonian dissimilarities

DOI10.1007/S003579900015MaRDI QIDQ1378872zbMATH OpenOpenAlexFDO

Authors Victor Chepoi, Bernard Fichet

Publication date 9 February 1998

Published in Journal of Classification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s003579900015

zbMATH Keywords

Robinsonian dissimilaritiesdivide-and-conquer algorithmorder compatible with a dissimilarity

Mathematics Subject Classification ID

Applications of graph theory (05C90) Complexity and performance of numerical algorithms (65Y20) Clustering in the social and behavioral sciences (91C20) Hypergraphs (05C65) Software, source code, etc. for problems pertaining to biology (92-04)

Recommendations

• An optimal algorithm to recognize Robinsonian dissimilarities
• On Robinsonian dissimilarities, the consecutive ones property and latent variable models
• Robinsonian matrices: recognition challenges

Cites work

• scientific article; zbMATH DE number 3839165 (Why is no real title available?)
• scientific article; zbMATH DE number 3843553 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4213811 (Why is no real title available?)
• scientific article; zbMATH DE number 4098484 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3996907 (Why is no real title available?)
• scientific article; zbMATH DE number 802809 (Why is no real title available?)
• scientific article; zbMATH DE number 892273 (Why is no real title available?)
• Incidence matrices and interval graphs
• Incidence matrices, interval graphs and seriation in archeology
• Mathematical classification and clustering
• SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(17)

• The weighted sitting closer to friends than enemies problem in the line
• Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
• An optimal algorithm to recognize Robinsonian dissimilarities
• Robinsonian matrices: recognition challenges
• A structural characterization for certifying Robinsonian matrices
• Combinatorial optimisation and hierarchical classifications
• Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
• The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
• Similarity-first search: a new algorithm with application to Robinsonian matrix recognition
• An Optimal Algorithm for Strict Circular Seriation
• A Simple and Optimal Algorithm for Strict Circular Seriation
• Modules in Robinson Spaces
• On Robinsonian dissimilarities, the consecutive ones property and latent variable models
• Robinson Cubes
• \texttt{PQser:} a Matlab package for spectral seriation
• The seriation problem in the presence of a double Fiedler value
• Two simple but efficient algorithms to recognize Robinson dissimilarities

This page was built for publication: Recognition of Robinsonian dissimilarities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378872)