Vertex-weighted graphs: realizable and unrealizable domains

DOI10.1007/978-3-030-96731-4_26OpenAlexW4225992555MaRDI QIDQ2154111FDOQ2154111

Authors: Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz 

Publication date: 13 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-96731-4_26

zbMATH Keywords

degree sequencegraph realizationgraph-algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• A fast algorithm for constructing trees from distance matrices
• Distance realization problems with applications to internet tomography
• Title not available (Why is that?)
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A note on a theorem of Erdős and Gallai
• A remark on the existence of finite graphs
• Title not available (Why is that?)
• Seven criteria for integer sequences being graphic
• A sequential importance sampling algorithm for generating random graphs with prescribed degrees
• On optimal realizations of finite metric spaces by graphs
• Distance matrix of a graph and its realizability
• Graphs and degree sequences. II
• Realizability and uniqueness in graphs
• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• A constructive algorithm for realizing a distance matrix
• A simple criterion on degree sequences of graphs
• A simple proof of the Erdos-Gallai theorem on graph sequences
• Weighted microscopic image reconstruction
• Title not available (Why is that?)
• An algorithm and its role in the study of optimal graph realizations of distance matrices
• Title not available (Why is that?)
• Fast Sequential Creation of Random Realizations of Degree Sequences
• Realizability of graph specifications: characterizations and algorithms
• Graphs and degree sequences. I
• Vertex-weighted realizations of graphs
• On vertex-weighted realizations of acyclic and general graphs
• Graphs and degree sequences: A survey. III

Cited In (3)

• The realizable extension problem and the weighted graph \((K _{3,3}, l)\)
• On vertex-weighted realizations of acyclic and general graphs
• On vertex-weighted graph realizations

This page was built for publication: Vertex-weighted graphs: realizable and unrealizable domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154111)