Modules in Robinson Spaces
From MaRDI portal
Publication:6187080
DOI10.1137/22m1494348zbMath1528.68260arXiv2203.12386OpenAlexW4285054917MaRDI QIDQ6187080
Guyslain Naves, Unnamed Author, Victor Chepoi, Pascal Préa
Publication date: 10 January 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.12386
Classification and discrimination; cluster analysis (statistical aspects) (62H30) General topics of discrete mathematics in relation to computer science (68R01) Nonnumerical algorithms (68W05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Total orders (06A05)
Cites Work
- Unnamed Item
- 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 survey of the algorithmic aspects of modular decomposition
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
- 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
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms
- Theory of 2-structures. II: Representation through labeled tree families
- Partitive hypergraphs
- 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
- Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
- Purely Functional Data Structures
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- An Optimal Algorithm for Strict Circular Seriation
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition
- An Optimization Parameter for Seriation of Noisy Data
- The Structural Representation of Proximity Matrices with MATLAB
- A Simple and Optimal Algorithm for Strict Circular Seriation
- Localization in 1D non-parametric latent space models from pairwise affinities
This page was built for publication: Modules in Robinson Spaces
