Graph realization of distance sets
From MaRDI portal
Publication:6633568
DOI10.1016/J.TCS.2024.114810MaRDI QIDQ6633568
Mor Perry, Amotz Bar-Noy, David Peleg, Dror Rawitz
Publication date: 6 November 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weighted graphs with distances in given ranges
- A constructive algorithm for realizing a distance matrix
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- On optimal realizations of finite metric spaces by graphs
- A fast algorithm for constructing trees from distance matrices
- Distance realization problems with applications to internet tomography
- An Optimality Criterion for Graph Embeddings of Metrics
- On the Complexity of Timetable and Multicommodity Flow Problems
- Recognition of Tree Metrics
- Fast Parallel Recognition of Ultrametrics and Tree Metrics
- Distance matrix of a graph and its realizability
- Composed degree-distance realizations of graphs
- Efficient algorithms for integer programs with two variables per constraint.
This page was built for publication: Graph realization of distance sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633568)
