Robinsonian matrices: recognition challenges
From MaRDI portal
Publication:2403299
Recommendations
Cites work
- A four-sweep LBFS recognition algorithm for interval graphs
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- A tie-break model for graph search
- An optimal algorithm to recognize Robinsonian dissimilarities
- Another well-solvable case of the QAP: maximizing the job completion time variance
- Fast Parallel Recognition of Ultrametrics and Tree Metrics
- Graphic vertices of the metric polytope
- scientific article; zbMATH DE number 1003286 (Why is no real title available?)
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- Linear time LexDFS on cocomparability graphs
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs
- Moplex orderings generated by the LexDFs algorithm
- On the recognition of permuted bottleneck Monge matrices
- Piecewise-convex maximization problems.
- Recognition of Robinsonian dissimilarities
- Representation of a finite graph by a set of intervals on the real line
- Separability generalizes Dirac's theorem
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
- Similarity-first search: a new algorithm with application to Robinsonian matrix recognition
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms
- The cone of Monge matrices: Extremal rays and applications
- The LBFS structure and recognition of interval graphs
- The order dimension of the complete graph
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- Weak Monge arrays in higher dimensions
Cited in
(11)- Recognition of Robinsonian dissimilarities
- The weighted sitting closer to friends than enemies problem in the line
- On Robinsonian dissimilarities, the consecutive ones property and latent variable models
- An optimal algorithm to recognize Robinsonian dissimilarities
- scientific article; zbMATH DE number 802814 (Why is no real title available?)
- A structural characterization for certifying Robinsonian matrices
- Similarity-first search: a new algorithm with application to Robinsonian matrix recognition
- An approximation algorithm for \(\ell_{\infty}\) fitting Robinson structures to distances
- Modules in Robinson Spaces
- Robust recovery of Robinson property in L^p-graphons: a cut-norm approach
- Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
This page was built for publication: Robinsonian matrices: recognition challenges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2403299)
