Relaxed and approximate graph realizations
type: Item
instance of: scholarly article
title: Relaxed and approximate graph realizations
DOI: 10.1007/978-3-030-79987-8_1
author: Amotz Bar-Noy
author: Toni Böhnlein
author: David Peleg
author: Mor Perry
author: Dror Rawitz
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7495010
MaRDI profile type: Publication
full work available at URL: 978-3-030-79987-8 1
OpenAlex ID: W3177066272
cites work: Planar bipartite biregular degree sequences
cites work: Realizability and uniqueness in graphs
cites work: Reconstructing Binary Matrices under Window Constraints from their Row and Column Sums
cites work: Dynamic discrete tomography
cites work: On Double-Resolution Imaging and Discrete Tomography
cites work: On optimal realizations of finite metric spaces by graphs
cites work: Properties of a Class of (0,1)-Matrices Covering a given Matrix
cites work: An algorithmic proof of Tutte's f-factor theorem
cites work: Recognition of Tree Metrics
cites work: The Generalized Microscopic Image Reconstruction Problem
cites work: Efficiently Realizing Interval Sequences
cites work: Composed degree-distance realizations of graphs
cites work: A sequential importance sampling algorithm for generating random graphs with prescribed degrees
cites work: A dynamic network population model with strategic link formation governed by individual preferences
cites work: Graphic deviation
cites work: Game theoretical modelling of a dynamically evolving network. I: General target sequences
cites work: Sufficient Conditions for Graphicality of Bidegree Sequences
cites work: Solution to a problem on degree sequences of graphs
cites work: On the realization of a (p,s)-digraph with prescribed degrees
cites work: On forcibly hereditary P-graphical sequences
cites work: A simple proof of the Erdos-Gallai theorem on graph sequences
cites work: Distance realization problems with applications to internet tomography
cites work: Conditions for sequences to be r-graphic
cites work: Fast Sequential Creation of Random Realizations of Degree Sequences
cites work: A fast algorithm for constructing trees from distance matrices
cites work: A remark concerning graphical sequences
cites work: Fast Parallel Recognition of Ultrametrics and Tree Metrics
cites work: Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
cites work: Q3287781
cites work: A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
cites work: On-line path computation and function placement in SDNs
cites work: An Approximation Algorithm for Path Computation and Function Placement in SDNs
cites work: Q4418664
cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements
cites work: Binary matrices under the microscope: A tomographical problem
cites work: Scanning integer matrices by means of two rectangular windows
cites work: Zero-one matrices with zero trace
cites work: A theorem on flows in networks
cites work: Constructive extensions of two results on graphic sequences
cites work: Uniqueness in Discrete Tomography: Three Remarks and a Corollary
cites work: Q5167708
cites work: Graphic sequences of trees and a problem of Frobenius
cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
cites work: Distance matrix of a graph and its realizability
cites work: Threshold Sequences
cites work: The splittance of a graph
cites work: NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs
cites work: A remark on the existence of finite graphs
cites work: A simple existence criterion for \((g<f)\)-factors
cites work: Linear-time certifying algorithms for near-graphical sequences
cites work: Discrete tomography. Foundations, algorithms, and applications
cites work: Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
cites work: A congruence theorem for trees
cites work: Degree-based graph construction
cites work: Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops
cites work: Algorithms for constructing graphs and digraphs with given valences and factors
cites work: Service chain placement in SDNs
cites work: On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
cites work: Subgraphs with prescribed valencies
cites work: Q4097183
cites work: Homogeneous subsets of \(\mathbb Z^2\) and plane tilings
cites work: Ulam's Conjecture and Graph Reconstructions
cites work: On Determining Minimal Singularities for the Realizations of an Incidence Sequence
cites work: On Determining the Minimum Number of Multiple Edges for an Incidence Sequence

Relaxed and approximate graph realizations (cites work)
cites work: The distance matrix of a graph and its tree realization

Relaxed and approximate graph realizations (cites work)
cites work: Combinatorial Properties of Matrices of Zeros and Ones

Relaxed and approximate graph realizations (cites work)
cites work: On Planar Graphical Degree Sequences

Relaxed and approximate graph realizations (cites work)
cites work: Seven criteria for integer sequences being graphic

Relaxed and approximate graph realizations (cites work)
cites work: An Optimality Criterion for Graph Embeddings of Metrics

Relaxed and approximate graph realizations (cites work)
cites work: An algorithm and its role in the study of optimal graph realizations of distance matrices

Relaxed and approximate graph realizations (cites work)
cites work: A simple criterion on degree sequences of graphs

Relaxed and approximate graph realizations (cites work)
cites work: A short constructive proof of the Erdős-Gallai characterization of graphic lists

Relaxed and approximate graph realizations (cites work)
cites work: A note on a theorem of Erdős and Gallai

Relaxed and approximate graph realizations (cites work)
cites work: Graph factors

Relaxed and approximate graph realizations (cites work)
cites work: Decomposition of graphical sequences and unigraphs

Relaxed and approximate graph realizations (cites work)
cites work: Graphs and degree sequences. I

Relaxed and approximate graph realizations (cites work)
cites work: Graphs and degree sequences. II

Relaxed and approximate graph realizations (cites work)
cites work: Graphs and degree sequences: A survey. III

Relaxed and approximate graph realizations (cites work)
cites work: Graphs and degree sequences: Canonical decomposition

Relaxed and approximate graph realizations (cites work)
cites work: Q3259049

Relaxed and approximate graph realizations (cites work)
cites work: A constructive algorithm for realizing a distance matrix

Relaxed and approximate graph realizations (cites work)
cites work: Q4263664

Relaxed and approximate graph realizations (cites work)
cites work: Contributions to the theory of graphic sequences