Cites work
- scientific article; zbMATH DE number 3141308 (Why is no real title available?)
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 3517028 (Why is no real title available?)
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- scientific article; zbMATH DE number 1962827 (Why is no real title available?)
- A congruence theorem for trees
- A constructive algorithm for realizing a distance matrix
- A dynamic network population model with strategic link formation governed by individual preferences
- A fast algorithm for constructing trees from distance matrices
- A note on a theorem of Erdős and Gallai
- A remark concerning graphical sequences
- A remark on the existence of finite graphs
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- A simple criterion on degree sequences of graphs
- A simple existence criterion for \((g<f)\)-factors
- A simple proof of the Erdos-Gallai theorem on graph sequences
- A theorem on flows in networks
- A variant of Niessen's problem on degree sequences of graphs
- Algorithms for constructing graphs and digraphs with given valences and factors
- An Optimality Criterion for Graph Embeddings of Metrics
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- An algorithmic proof of Tutte's f-factor theorem
- An approximation algorithm for path computation and function placement in SDNs
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Binary matrices under the microscope: A tomographical problem
- Combinatorial Properties of Matrices of Zeros and Ones
- Composed degree-distance realizations of graphs
- Conditions for sequences to be r-graphic
- Constructive extensions of two results on graphic sequences
- Contributions to the theory of graphic sequences
- Decomposition of graphical sequences and unigraphs
- Degree-based graph construction
- Discrete tomography. Foundations, algorithms, and applications
- Distance matrix of a graph and its realizability
- Distance realization problems with applications to internet tomography
- Dynamic discrete tomography
- Efficiently realizing interval sequences
- Fast Parallel Recognition of Ultrametrics and Tree Metrics
- Fast sequential creation of random realizations of degree sequences
- Game theoretical modelling of a dynamically evolving network. I: General target sequences
- Graph factors
- Graphic deviation
- Graphic sequences of trees and a problem of Frobenius
- Graphs and degree sequences. I
- Graphs and degree sequences. II
- Graphs and degree sequences: A survey. III
- Graphs and degree sequences: Canonical decomposition
- Homogeneous subsets of Z^2 and plane tilings
- Linear-time certifying algorithms for near-graphical sequences
- Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops
- Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
- On Determining Minimal Singularities for the Realizations of an Incidence Sequence
- On Determining the Minimum Number of Multiple Edges for an Incidence Sequence
- On Planar Graphical Degree Sequences
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On double-resolution imaging and discrete tomography
- On forcibly hereditary P-graphical sequences
- On optimal realizations of finite metric spaces by graphs
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- On the realization of a (p,s)-digraph with prescribed degrees
- On-line path computation and function placement in SDNs
- Planar bipartite biregular degree sequences
- Properties of a Class of (0,1)-Matrices Covering a given Matrix
- Realizability and uniqueness in graphs
- Recognition of Tree Metrics
- Reconstructing binary matrices under window constraints from their row and column sums
- Scanning integer matrices by means of two rectangular windows
- Service chain placement in SDNs
- Seven criteria for integer sequences being graphic
- Solution to a problem on degree sequences of graphs
- Subgraphs with prescribed valencies
- Sufficient conditions for graphicality of bidegree sequences
- The Generalized Microscopic Image Reconstruction Problem
- The distance matrix of a graph and its tree realization
- The splittance of a graph
- Threshold Sequences
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Ulam's Conjecture and Graph Reconstructions
- Uniqueness in discrete tomography: Three remarks and a corollary
- Zero-one matrices with zero trace
Cited in
(3)
This page was built for publication: Relaxed and approximate graph realizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115836)
