On vertex-weighted graph realizations
From MaRDI portal
Publication:2692719
DOI10.1007/978-3-030-75242-2_6OpenAlexW3159500806MaRDI QIDQ2692719
Amotz Bar-Noy, Toni Böhnlein, Dror Rawitz, David Peleg
Publication date: 22 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_6
Cites Work
- Unnamed Item
- Unnamed Item
- Weighted microscopic image reconstruction
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- A simple criterion on degree sequences of graphs
- On the equal-subset-sum problem
- Realizability and uniqueness in graphs
- Realizability of graph specifications: characterizations and algorithms
- A note on a theorem of Erdős and Gallai
- Vertex-weighted realizations of graphs
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- A remark on the existence of finite graphs
- A simple proof of the Erdos-Gallai theorem on graph sequences
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Seven criteria for integer sequences being graphic
- Fast Sequential Creation of Random Realizations of Degree Sequences
- The Generalized Microscopic Image Reconstruction Problem
This page was built for publication: On vertex-weighted graph realizations
