Pages that link to "Item:Q2248666"
From MaRDI portal
The following pages link to Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices (Q2248666):
Displaying 12 items.
- Structural classification analysis of three-way dissimilarity data (Q265307) (← links)
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices (Q463122) (← links)
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming (Q2260052) (← links)
- On Robinsonian dissimilarities, the consecutive ones property and latent variable models (Q2442774) (← links)
- Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition (Q2445688) (← links)
- Combinatorial optimisation and hierarchical classifications (Q2480261) (← links)
- The seriation problem in the presence of a double Fiedler value (Q2679667) (← links)
- An Optimal Algorithm for Strict Circular Seriation (Q5018899) (← links)
- Lower (Anti-)Robinson Rank Representations for Symmetric Proximity Matrices (Q5302536) (← links)
- A Simple and Optimal Algorithm for Strict Circular Seriation (Q5888295) (← links)
- Modules in Robinson Spaces (Q6187080) (← links)
