Vertex-weighted graphs: realizable and unrealizable domains
From MaRDI portal
Publication:2154111
DOI10.1007/978-3-030-96731-4_26OpenAlexW4225992555MaRDI QIDQ2154111
Dror Rawitz, David Peleg, Amotz Bar-Noy, Toni Böhnlein
Publication date: 13 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-96731-4_26
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weighted microscopic image reconstruction
- A constructive algorithm for realizing a distance matrix
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- A simple criterion on degree sequences of graphs
- On optimal realizations of finite metric spaces by graphs
- A fast algorithm for constructing trees from distance matrices
- Realizability and uniqueness in graphs
- Distance realization problems with applications to internet tomography
- Realizability of graph specifications: characterizations and algorithms
- A note on a theorem of Erdős and Gallai
- Vertex-weighted realizations of graphs
- On vertex-weighted realizations of acyclic and general graphs
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- A remark on the existence of finite graphs
- Graphs and degree sequences. II
- A simple proof of the Erdos-Gallai theorem on graph sequences
- Graphs and degree sequences. I
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Seven criteria for integer sequences being graphic
- Graphs and degree sequences: A survey. III
- Distance matrix of a graph and its realizability
- Fast Sequential Creation of Random Realizations of Degree Sequences
This page was built for publication: Vertex-weighted graphs: realizable and unrealizable domains
