Recognition of Robinsonian dissimilarities
DOI10.1007/S003579900015zbMATH Open0905.92036OpenAlexW1994466493MaRDI QIDQ1378872FDOQ1378872
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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Incidence matrices and interval graphs
- Incidence matrices, interval graphs and seriation in archeology
- Mathematical classification and clustering
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (17)
- The weighted sitting closer to friends than enemies problem in the line
- Robinsonian matrices: recognition challenges
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
- An optimal algorithm to recognize Robinsonian dissimilarities
- 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)