Hypergraph recovery algorithms from a given vector of vertex degrees (Q2263922): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: HYPERGRAPHS / 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: Q4175596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical representation of multilayered hierarchical structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs as algebraic structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing 2-complexes by a nonnegative integer-valued vector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4851217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transportation problems with a minimax criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimax under nonlinear transportation constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open transportation models with a minimax criterion. / rank
 
Normal rank

Revision as of 20:14, 9 July 2024

scientific article
Language Label Description Also known as
English
Hypergraph recovery algorithms from a given vector of vertex degrees
scientific article

    Statements

    Identifiers