A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices

DOI10.1137/0605014MaRDI QIDQ3320428zbMATHOpenAlexFDO

Authors J. M. S. Simões-Pereira

Publication date 1984

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0605014

zbMATH Keywords

minimum total lengthquasimetricsoptimal digraph realizationsquasidistance matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Recommendations

• An algorithm and its role in the study of optimal graph realizations of distance matrices
• On optimal realizations of finite metric spaces by graphs
• An Optimality Criterion for Graph Embeddings of Metrics
• On optimal embeddings of metrics in graphs
• A note on completing quasi-distance and distance matrices

Cites work

• scientific article; zbMATH DE number 3648765 (Why is no real title available?)
• scientific article; zbMATH DE number 3307342 (Why is no real title available?)
• A method for the linear recording of graphs
• A note on the metric properties of trees
• A note on the tree realizability of a distance matrix
• An Optimal Diagonal Tree Code
• Diagonal tree codes
• Distance matrix of a graph and its realizability
• Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
• On optimal embeddings of metrics in graphs
• Properties of the distance matrix of a tree
• Submatrices of non-tree-realizable distance matrices
• Technologies for constructing intelligent systems. 2: Tools
• The distance matrix of a graph and its tree realization
• The structure of distances in networks
• The theory and computation of evolutionary distances: Pattern recognition

Cited in

(10)

• A note on completing quasi-distance and distance matrices
• On optimal realizations of finite metric spaces by graphs
• Injective optimal realizations of finite metric spaces
• A constructive algorithm for realizing a distance matrix
• A note on distance matrices with unicyclic graph realizations
• Distance spectra of graphs: a survey
• An algorithm for tree-realizability of distance matrices^∗
• On optimal embeddings of metrics in graphs
• The tower matrix, an alternative to deal with distances and quasi-distances
• The graph bottleneck identity

This page was built for publication: A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320428)