Pages that link to "Item:Q1163034"

The following pages link to Submatrices of non-tree-realizable distance matrices (Q1163034):

Displaying 17 items.

• Reconstructing the shape of a tree from observed dissimilarity data (Q103560) (← links)
• An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex (Q696831) (← links)
• On optimal embeddings of metrics in graphs (Q794666) (← links)
• Reconstruction of graphs based on random walks (Q837176) (← 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)
• On optimal realizations of finite metric spaces by graphs (Q1100481) (← links)
• A fast algorithm for constructing trees from distance matrices (Q1116346) (← links)
• A note on distance matrices with unicyclic graph realizations (Q1121283) (← links)
• A canonical decomposition theory for metrics on a finite set (Q1190163) (← links)
• Trees related to realizations of distance matrices (Q1584445) (← links)
• Distance realization problems with applications to internet tomography (Q1604199) (← links)
• Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem (Q1752190) (← links)
• Distance spectra of graphs: a survey (Q2250935) (← links)
• Recognizing and realizing cactus metrics (Q2296277) (← links)
• A note on convexity and submatrices of distance matrices (Q3029037) (← links)
• A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices (Q3320428) (← links)