A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices

DOI10.1137/0605014zbMath0536.05048OpenAlexW1999684244MaRDI QIDQ3320428

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

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

Related Items

On optimal realizations of finite metric spaces by graphs, A constructive algorithm for realizing a distance matrix, An algorithm for tree-realizability of distance matrices^∗, A note on distance matrices with unicyclic graph realizations, Injective optimal realizations of finite metric spaces, Distance spectra of graphs: a survey, On optimal embeddings of metrics in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On optimal embeddings of metrics in graphs
• Submatrices of non-tree-realizable distance matrices
• A note on the metric properties of trees
• The structure of distances in networks
• The theory and computation of evolutionary distances: Pattern recognition
• Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
• The distance matrix of a graph and its tree realization
• Diagonal tree codes
• An Optimal Diagonal Tree Code
• Distance matrix of a graph and its realizability
• A method for the linear recording of graphs
• Properties of the distance matrix of a tree
• A note on the tree realizability of a distance matrix
• Technologies for constructing intelligent systems. 2: Tools