Hypergraph recovery algorithms from a given vector of vertex degrees
From MaRDI portal
Publication:2263922
DOI10.1134/S1064230714040091zbMATH Open1308.05081OpenAlexW2094931947MaRDI QIDQ2263922FDOQ2263922
Authors: D. S. Kostyanoi, A. V. Mokryakov, V. I. Tsurkov 
Publication date: 19 March 2015
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064230714040091
Recommendations
- Reconstructing 2-complexes by a nonnegative integer-valued vector
- On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
- On the degree sequences of uniform hypergraphs
- Operations over \(k\)-homogeneous hypergraphs and their vectors of the degrees of the vertices
- New sufficient conditions on the degree sequences of uniform hypergraphs
Cites Work
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Hypergraphs as algebraic structures
- Graphical representation of multilayered hierarchical structures
- Uniform generalized graphs
- Title not available (Why is that?)
- HYPERGRAPHS
- Title not available (Why is that?)
- About realization of integer non-negative numbers tuple into 2-dimensional complexes
- Transportation problems with a minimax criterion
- A minimax under nonlinear transportation constraints.
- Open transportation models with a minimax criterion.
- Reconstructing 2-complexes by a nonnegative integer-valued vector
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees
- Reconstructing 2-complexes by a nonnegative integer-valued vector
- Signatures of extremal 2-unifrom hypergraphs
- Weighted 2-sections and hypergraph reconstruction
- Operations over \(k\)-homogeneous hypergraphs and their vectors of the degrees of the vertices
- Development of hypergraph theory
- Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs
- Algorithm of multidimensional data transmission using extremal uniform hypergraphs
This page was built for publication: Hypergraph recovery algorithms from a given vector of vertex degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2263922)
