Hypergraph recovery algorithms from a given vector of vertex degrees

DOI10.1134/S1064230714040091MaRDI QIDQ2263922zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Hypergraphs (05C65)

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

• scientific article; zbMATH DE number 3885960 (Why is no real title available?)
• scientific article; zbMATH DE number 5654190 (Why is no real title available?)
• scientific article; zbMATH DE number 3609723 (Why is no real title available?)
• scientific article; zbMATH DE number 803930 (Why is no real title available?)
• A minimax under nonlinear transportation constraints.
• About realization of integer non-negative numbers tuple into 2-dimensional complexes
• Graphical representation of multilayered hierarchical structures
• HYPERGRAPHS
• Hypergraphs as algebraic structures
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Open transportation models with a minimax criterion.
• Reconstructing 2-complexes by a nonnegative integer-valued vector
• Transportation problems with a minimax criterion
• Uniform generalized graphs

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
• Algorithm of multidimensional data transmission using extremal uniform hypergraphs
• Combination of bases and an evaluation of the set of extremal 3-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)