Relaxed and approximate graph realizations
From MaRDI portal
Publication:2115836
DOI10.1007/978-3-030-79987-8_1OpenAlexW3177066272MaRDI QIDQ2115836FDOQ2115836
David Peleg, Toni Böhnlein, Mor Perry, Amotz Bar-Noy, Dror Rawitz
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_1
Cites Work
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Discrete tomography. Foundations, algorithms, and applications
- Title not available (Why is that?)
- A theorem on flows in networks
- A fast algorithm for constructing trees from distance matrices
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- Distance realization problems with applications to internet tomography
- Uniqueness in Discrete Tomography: Three Remarks and a Corollary
- Recognition of Tree Metrics
- Title not available (Why is that?)
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Decomposition of graphical sequences and unigraphs
- A note on a theorem of Erdős and Gallai
- Algorithms for constructing graphs and digraphs with given valences and factors
- A remark concerning graphical sequences
- A remark on the existence of finite graphs
- Combinatorial Properties of Matrices of Zeros and Ones
- Seven criteria for integer sequences being graphic
- Title not available (Why is that?)
- A congruence theorem for trees
- The splittance of a graph
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- On optimal realizations of finite metric spaces by graphs
- Graph factors
- The distance matrix of a graph and its tree realization
- Distance matrix of a graph and its realizability
- Subgraphs with prescribed valencies
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- On the realization of a (p,s)-digraph with prescribed degrees
- Zero-one matrices with zero trace
- Graphs and degree sequences. II
- Contributions to the theory of graphic sequences
- Realizability and uniqueness in graphs
- Solution to a problem on degree sequences of graphs
- Degree-based graph construction
- Threshold Sequences
- Constructive extensions of two results on graphic sequences
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- An algorithmic proof of Tutte's f-factor theorem
- A constructive algorithm for realizing a distance matrix
- Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
- Fast Parallel Recognition of Ultrametrics and Tree Metrics
- Properties of a Class of (0,1)-Matrices Covering a given Matrix
- Sufficient Conditions for Graphicality of Bidegree Sequences
- A simple existence criterion for \((g<f)\)-factors
- Linear-time certifying algorithms for near-graphical sequences
- On Planar Graphical Degree Sequences
- Conditions for sequences to be r-graphic
- A simple criterion on degree sequences of graphs
- A simple proof of the Erdos-Gallai theorem on graph sequences
- Graphs and degree sequences: Canonical decomposition
- Game theoretical modelling of a dynamically evolving network. I: General target sequences
- A dynamic network population model with strategic link formation governed by individual preferences
- Graphic deviation
- Homogeneous subsets of \(\mathbb Z^2\) and plane tilings
- On Double-Resolution Imaging and Discrete Tomography
- Reconstructing Binary Matrices under Window Constraints from their Row and Column Sums
- Dynamic discrete tomography
- The Generalized Microscopic Image Reconstruction Problem
- Binary matrices under the microscope: A tomographical problem
- Scanning integer matrices by means of two rectangular windows
- An Optimality Criterion for Graph Embeddings of Metrics
- Title not available (Why is that?)
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- On Determining Minimal Singularities for the Realizations of an Incidence Sequence
- Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Sequential Creation of Random Realizations of Degree Sequences
- Planar bipartite biregular degree sequences
- Efficiently Realizing Interval Sequences
- Graphs and degree sequences. I
- NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs
- On forcibly hereditary P-graphical sequences
- Service chain placement in SDNs
- An Approximation Algorithm for Path Computation and Function Placement in SDNs
- Graphic sequences of trees and a problem of Frobenius
- Graphs and degree sequences: A survey. III
- Ulam's Conjecture and Graph Reconstructions
- On Determining the Minimum Number of Multiple Edges for an Incidence Sequence
- Composed degree-distance realizations of graphs
- On-line path computation and function placement in SDNs
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)
