Distance matrix of a graph and its realizability
From MaRDI portal
Cited in
(67)- A tropical interpretation of \(m\)-dissimilarity maps
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Computational complexity of inferring phylogenies from dissimilarity matrices
- Underlying graph and total length of optimal realizations of variable distance matrices
- On optimal realizations of finite metric spaces by graphs
- Graph theoretic foundations of pathfinder networks
- A fast backtrack algorithm for graph isomorphism
- A fast algorithm for constructing trees from distance matrices
- A note on distance matrices with unicyclic graph realizations
- Submatrices of non-tree-realizable distance matrices
- Free trees and bidirectional trees as representations of psychological distance
- Tree representations of ternary relations
- Some personal views on the current state and the future of locational analysis
- Trees related to realizations of distance matrices
- Distance realization problems with applications to internet tomography
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
- Reconstructing trees from subtree weights.
- Distance matrices on the \textit{H-join} of graphs: a general result and applications
- Searching for realizations of finite metric spaces in tight spans
- Optimal realizations and the block decomposition of a finite metric space
- Relaxed and approximate graph realizations
- A Calderón type inverse problem for tree graphs
- Vertex-weighted graphs: realizable and unrealizable domains
- Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs
- Smith normal form of a distance matrix inspired by the four-point condition
- Reconstructibility of unrooted level-k phylogenetic networks from distances
- Level-\(2\) networks from shortest and longest distances
- Distance spectra of graphs: a survey
- Representation of a tree with p hanging vertices by 2p-3 elements of its distance matrix
- Recognizing and realizing cactus metrics
- Treelike families of multiweights
- Optimal realizations of two-dimensional, totally-decomposable metrics
- Minimal networks: a review
- Extremal properties of the distance spectral radius of hypergraphs
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
- Weighted graphs with distances in given ranges
- A note on tree realizations of matrices
- On the weights of simple paths in weighted complete graphs
- On graphlike \(k\)-dissimilarity vectors
- Injective optimal realizations of finite metric spaces
- New bounds on the distance Laplacian and distance signless Laplacian spectral radii
- scientific article; zbMATH DE number 6857397 (Why is no real title available?)
- Composed degree-distance realizations of graphs
- Composed degree-distance realizations of graphs
- Distance conserving reductions for nonoriented networks
- Distance spectral radii of \(k\)-uniform hypertrees with fixed diameter
- Graph realization of distance sets
- Closeness centrality reconstruction of tree graphs
- Optimizing over path-length matrices of unrooted binary trees
- Computational complexity of combinatorial distance matrix realisation
- Temporal graph realization from fastest paths
- Metric symmetry and distance distribution functions on graphs
- Parameterized algorithms for multi-label periodic temporal graph realization
- Reconstructing a graph from the boundary distance matrix
- Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem
- Temporal graph realization with bounded stretch
- Modern theory of electrical networks: from the matrix-tree theorem to the theory of cluster varieties
- Realizing temporal transportation trees
- Temporal graph realization with bounded stretch
- The metric cutpoint partition problem
- Learning latent tree models with small query complexity
- Metrics on spaces of finite trees
- Moduli space of families of positive \((n - 1)\)-weights
- On optimal embeddings of metrics in graphs
- Reconstruction of graphs based on random walks
- A constructive algorithm for realizing a distance matrix
- An algorithm and its role in the study of optimal graph realizations of distance matrices
This page was built for publication: Distance matrix of a graph and its realizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5329581)
