Totally unimodular Leontief directed hypergraphs (Q1904049): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Characterization of Totally Unimodular Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gainfree Leontief substitution flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme points of Leontief substitution systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Latest revision as of 07:51, 24 May 2024

scientific article
Language Label Description Also known as
English
Totally unimodular Leontief directed hypergraphs
scientific article

    Statements

    Totally unimodular Leontief directed hypergraphs (English)
    0 references
    0 references
    0 references
    18 June 1996
    0 references
    A Leontief directed hypergraph is a generalization of a directed graph, where arcs have multiple (or no) tails and at most one head. The authors define a subclass of Leontief directed hypergraphs via forbidden odd pseudocycles. They show that the vertex-hyperarc incidence matrices of the hypergraphs in this subclass are totally unimodular. In addition, they present examples of Leontief directed hypergraphs that are graphic, cographic, and neither graphic nor cographic.
    0 references
    0 references
    unimodular matrices
    0 references
    Leontief directed hypergraph
    0 references
    pseudocycles
    0 references

    Identifiers