Near-perfect matrices (Q1332310): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: F. Bruce Shepherd / rank
Normal rank
 
Property / author
 
Property / author: F. Bruce Shepherd / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Rounding for Polymatroid and Branching Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical properties related to minimal imperfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial designs related to the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra for Composed Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / 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: Q3320435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect zero–one matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost integral polyhedra related to certain combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical perfect graphs and perfect 3-chromatic graphs / rank
 
Normal rank

Latest revision as of 16:44, 22 May 2024

scientific article
Language Label Description Also known as
English
Near-perfect matrices
scientific article

    Statements

    Near-perfect matrices (English)
    0 references
    10 October 1994
    0 references
    strong perfect graph conjecture
    0 references
    clique-node incidence matrices
    0 references
    near- perfect graphs
    0 references
    perfect matrices
    0 references
    imperfect graphs
    0 references
    0 references

    Identifiers

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