Two simple but efficient algorithms to recognize Robinson dissimilarities
From MaRDI portal
Publication:6657924
DOI10.1007/s00357-023-09446-yMaRDI QIDQ6657924
Guyslain Naves, Pascal Préa, Unnamed Author, Victor Chepoi
Publication date: 7 January 2025
Published in: Journal of Classification (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- 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
- Recognition of Robinsonian dissimilarities
- NP-hard approximation problems in overlapping clustering.
- A Lex-BFS-based recognition algorithm for Robinsonian matrices
- Four-point conditions for the TSP: the complete complexity classification
- Three Partition Refinement Algorithms
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- Edgeconvex Circuits and the Traveling Salesman Problem
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition
- The Structural Representation of Proximity Matrices with MATLAB
This page was built for publication: Two simple but efficient algorithms to recognize Robinson dissimilarities
