A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices

DOI10.1137/0605014zbMATH Open0536.05048OpenAlexW1999684244MaRDI QIDQ3320428FDOQ3320428

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

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

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)

Cites Work

• Submatrices of non-tree-realizable distance matrices
• A note on the metric properties of trees
• A note on the tree realizability of a distance matrix
• On optimal embeddings of metrics in graphs
• 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
• Distance matrix of a graph and its realizability
• An Optimal Diagonal Tree Code
• The structure of distances in networks
• A method for the linear recording of graphs
• Title not available (Why is that?)
• Diagonal tree codes
• Properties of the distance matrix of a tree
• Title not available (Why is that?)
• Technologies for constructing intelligent systems. 2: Tools

Cited In (8)

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

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)