On perfect \(0,\pm 1\) matrices (Q1356731): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Polynomial-time inference of all valid implications for Horn and related formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Index for Satisfiability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of \(q\)-Horn formulae in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral sets having a least element / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alpha-balanced graphs and matrices and GF(3)-representability of matroids / rank
 
Normal rank

Revision as of 14:13, 27 May 2024

scientific article
Language Label Description Also known as
English
On perfect \(0,\pm 1\) matrices
scientific article

    Statements

    On perfect \(0,\pm 1\) matrices (English)
    0 references
    0 references
    0 references
    10 June 1997
    0 references
    perfect \(0\), \(\pm 1\) matrices
    0 references
    associated perfect graph
    0 references
    generalized set packing polytope
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references