A simple and optimal algorithm for strict circular seriation
Recently, Armstrong, Guzmán, and Sing Long [SIAM J. Math. Data Sci., 3 (2021), pp. 1223–
1250] presented an optimal time algorithm for strict circular seriation (called also the …
1250] presented an optimal time algorithm for strict circular seriation (called also the …
Seriation of T {\oe} plitz and latent position matrices: optimal rates and computational trade-offs
C Berenfeld, A Carpentier, N Verzelen - arXiv preprint arXiv:2408.10004, 2024 - arxiv.org
In this paper, we consider the problem of seriation of a permuted structured matrix based on
noisy observations. The entries of the matrix relate to an expected quantification of …
noisy observations. The entries of the matrix relate to an expected quantification of …
Extending Robinson Spaces: Complexity and Algorithmic Solutions for Non-Symmetric Dissimilarity Spaces
In this work, we extend the concept of Robinson spaces to asymmetric dissimilarities,
enhancing their applicability in representing and analyzing complex data. Within this …
enhancing their applicability in representing and analyzing complex data. Within this …
Modules and PQ-trees in Robinson spaces
A Robinson space is a dissimilarity space $(X, d) $ on $ n $ points for which there exists a
compatible order,{\it ie} a total order $< $ on $ X $ such that $ x< y< z $ implies that $ d (x …
compatible order,{\it ie} a total order $< $ on $ X $ such that $ x< y< z $ implies that $ d (x …
Simple, linear-time modular decomposition
Modular decomposition is fundamental for many important problems in algorithmic graph
theory including transitive orientation, the recognition of several classes of graphs, and …
theory including transitive orientation, the recognition of several classes of graphs, and …