Composed degree-distance realizations of graphs
From MaRDI portal
Publication:5918621
DOI10.1007/978-3-030-79987-8_5OpenAlexW3173581508MaRDI QIDQ5918621
Dror Rawitz, Amotz Bar-Noy, David Peleg, Mor Perry
Publication date: 22 March 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_5
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weighted graphs with distances in given ranges
- A theorem on flows in networks
- On optimal embeddings of metrics in graphs
- 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
- A note on distance matrices with unicyclic graph realizations
- Contributions to the theory of graphic sequences
- Eccentric sequences in graphs
- Eccentric sequences and eccentric sets in graphs
- Distance realization problems with applications to internet tomography
- Realizability of graph specifications: characterizations and algorithms
- A note on the metric properties of trees
- Relaxed and approximate graph realizations
- Vertex-weighted realizations of graphs
- Graph profile realizations and applications to social networks
- Sufficient Conditions for Graphicality of Bidegree Sequences
- Combinatorial Properties of Matrices of Zeros and Ones
- Graphic sequences of trees and a problem of Frobenius
- An Optimality Criterion for Graph Embeddings of Metrics
- Multi-Terminal Network Flows
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- The distance matrix of a graph and its tree realization
- Recognition of Tree Metrics
- Fast Parallel Recognition of Ultrametrics and Tree Metrics
- An algorithmic proof of Tutte's f-factor theorem
- Distance matrix of a graph and its realizability
- A note on the tree realizability of a distance matrix
- On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
- Existence of k-edge connected ordinary graphs with prescribed degrees
