A Spectral Algorithm for Seriation and the Consecutive Ones Problem
From MaRDI portal
Publication:4210149
Recommendations
- Conley's spectral sequence via the sweeping algorithm
- A simple algorithm for the constrained sequence problems
- A spectral approach to consecutive pattern-avoiding permutations
- A generalized insertion algorithm for the seriation problem
- scientific article; zbMATH DE number 5606342
- An Optimal Algorithm for Strict Circular Seriation
- A Simple and Optimal Algorithm for Strict Circular Seriation
- Algorithms and Computation
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
- FPT algorithms for consecutive ones submatrix problems
Cited in
(48)- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
- Uniform embeddings for Robinson similarity matrices
- A faster algorithm for finding minimum Tucker submatrices
- Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
- An experimental comparison of seriation methods for one-mode two-way data
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- On Physical Mapping and the consecutive ones property for sparse matrices
- Two improved algorithms for envelope and wavefront reduction
- Convex relaxations for permutation problems
- Obtaining matrices with the consecutive ones property by row deletions
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- Similarity-first search: a new algorithm with application to Robinsonian matrix recognition
- scientific article; zbMATH DE number 5606342 (Why is no real title available?)
- Heuristic methods to consecutive block minimization
- Localization in 1D non-parametric latent space models from pairwise affinities
- An Optimal Algorithm for Strict Circular Seriation
- Minimising the number of gap-zeros in binary matrices
- Reconstruction of line-embeddings of graphons
- Graphs, vectors, and matrices
- Graph characteristics from the heat kernel trace
- The perturbed laplacian matrix of a graph
- Discovering bands from graphs
- An optimization parameter for seriation of noisy data
- A Simple and Optimal Algorithm for Strict Circular Seriation
- Regime switching model estimation: spectral clustering hidden Markov model
- Modules in Robinson Spaces
- A graph based Davidson algorithm for the graph partitioning problem
- Recovering the structure of random linear graphs
- A generalized insertion algorithm for the seriation problem
- Robust recovery of Robinson property in \(L^p\)-graphons: a cut-norm approach
- Experiments on the minimum linear arrangement problem
- Spectral Sequencing Based on Graph Distance
- \texttt{PQser:} a Matlab package for spectral seriation
- Three conjectures of Ostrander on digraph Laplacian eigenvectors
- Hidden Hamiltonian cycle recovery via linear programming
- The seriation problem in the presence of a double Fiedler value
- Periodic reordering
- Two simple but efficient algorithms to recognize Robinson dissimilarities
- Polynomial-time local-improvement algorithm for consecutive block minimization
- Seriation algorithms for determining the evolution of \textit{The Star Husband Tale}
- Continuation methods for approximate large scale object sequencing
- Graph spectral image smoothing using the heat kernel
- Heat kernel embeddings, differential geometry and graph structure
- Optimal rates of statistical seriation
- Estimation of Monge matrices
- Spectral reordering of a range-dependent weighted random graph
This page was built for publication: A Spectral Algorithm for Seriation and the Consecutive Ones Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210149)
