An optimal algorithm to recognize Robinsonian dissimilarities
From MaRDI portal
Recommendations
Cites work
- 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 3684908 (Why is no real title available?)
- scientific article; zbMATH DE number 53860 (Why is no real title available?)
- scientific article; zbMATH DE number 953009 (Why is no real title available?)
- scientific article; zbMATH DE number 802809 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
- Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees
- Doubly lexical ordering of dense 0--1 matrices
- Incidence matrices and interval graphs
- Incidence matrices, interval graphs and seriation in archeology
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Matrix visualization and information mining
- NP-hard approximation problems in overlapping clustering.
- Recognition of Robinsonian dissimilarities
- Relationship-based clustering and visualization for high-dimensional data mining
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Three Partition Refinement Algorithms
Cited in
(24)- 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
- Robinsonian matrices: recognition challenges
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
- Splitting metrics by \(T_0\)-quasi-metrics
- A structural characterization for certifying Robinsonian matrices
- Graph sequences sampled from Robinson graphons
- 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
- Splitting ultra-metrics by \(T_{0}\)-ultra-quasi-metrics
- Recognition of Robinsonian dissimilarities
- Similarity-first search: a new algorithm with application to Robinsonian matrix recognition
- An Optimal Algorithm for Strict Circular Seriation
- Testing a mixture model of single-peaked preferences
- An optimization parameter for seriation of noisy data
- A Simple and Optimal Algorithm for Strict Circular Seriation
- Cut norm discontinuity of triangular truncation of graphons
- Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
- Modules in Robinson Spaces
- On Robinsonian dissimilarities, the consecutive ones property and latent variable models
- Robust recovery of Robinson property in \(L^p\)-graphons: a cut-norm approach
- \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: An optimal algorithm to recognize Robinsonian dissimilarities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269174)
