Relaxed and approximate graph realizations (Q2115836): Difference between revisions

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

Latest revision as of 09:29, 28 July 2024

scientific article
Language Label Description Also known as
English
Relaxed and approximate graph realizations
scientific article

    Statements

    Relaxed and approximate graph realizations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers