Hypergraph recovery algorithms from a given vector of vertex degrees

DOI10.1134/S1064230714040091zbMath1308.05081OpenAlexW2094931947MaRDI QIDQ2263922

A. V. Mokryakov, D. S. Kostyanoi, Vladimir 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)

Related Items (5)

Signatures of extremal 2-unifrom hypergraphs ⋮ Development of hypergraph theory ⋮ First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees ⋮ Algorithm of multidimensional data transmission using extremal uniform hypergraphs ⋮ Operations over \(k\)-homogeneous hypergraphs and their vectors of the degrees of the vertices

Cites Work

• Hypergraphs as algebraic structures
• Graphical representation of multilayered hierarchical structures
• Transportation problems with a minimax criterion
• Uniform generalized graphs
• A minimax under nonlinear transportation constraints.
• Open transportation models with a minimax criterion.
• Reconstructing 2-complexes by a nonnegative integer-valued vector
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• HYPERGRAPHS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hypergraph recovery algorithms from a given vector of vertex degrees