Pages that link to "Item:Q1248492"

The following pages link to Free trees and bidirectional trees as representations of psychological distance (Q1248492):

Displaying 33 items.

• Reconstructing the shape of a tree from observed dissimilarity data (Q103560) (← links)
• Injective optimal realizations of finite metric spaces (Q418856) (← links)
• The metric cutpoint partition problem (Q734378) (← links)
• Reconstruction of graphs based on random walks (Q837176) (← links)
• A constructive algorithm for realizing a distance matrix (Q858334) (← links)
• An algorithm and its role in the study of optimal graph realizations of distance matrices (Q910418) (← links)
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces (Q1056946) (← links)
• The representation of three-way proximity data by single and multiple tree structure models (Q1059960) (← links)
• Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm (Q1070718) (← links)
• Extended similarity trees (Q1082753) (← links)
• Underlying graph and total length of optimal realizations of variable distance matrices (Q1095929) (← links)
• Graph theoretic foundations of pathfinder networks (Q1104895) (← links)
• A note on distance matrices with unicyclic graph realizations (Q1121283) (← links)
• Monotonic models for asymmetric proximities (Q1140059) (← links)
• A factorization procedure for finite algebras (Q1165880) (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
• The additive random feature model for unfolding and the feature structure of choice objects (Q1196916) (← links)
• Tree representations of ternary relations (Q1254039) (← links)
• Pairwise partitioning: A nonmetric algorithm for identifying feature-based similarity structures (Q1362283) (← links)
• Exploring the set-theoretical structure of objects by additive trees (Q1362284) (← links)
• Asymmetric multidimensional scaling of two-mode three-way proximities (Q1378866) (← links)
• A probabilistic feature model for unfolding tested for perfect and imperfect nestings (Q1384551) (← links)
• Trees related to realizations of distance matrices (Q1584445) (← links)
• \(l_\infty\)-approximation via subdominants. (Q1599172) (← links)
• Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem (Q1659722) (← links)
• Lattice-based similarity measures between ordered trees (Q1838813) (← links)
• A parametric procedure for ultrametric tree estimation from conditional rank order proximity data (Q1901372) (← links)
• A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees (Q1907945) (← links)
• Level-\(2\) networks from shortest and longest distances (Q2243145) (← links)
• Distance spectra of graphs: a survey (Q2250935) (← links)
• Ordinal network representation: Representing proximities by graphs (Q2277198) (← links)
• A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance (Q2563540) (← links)
• A note on convexity and submatrices of distance matrices (Q3029037) (← links)