Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors (Q314769): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Positive semidefinite matrices with a given sparsity pattern / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real positive definite completion problem: cycle completability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real positive definite completion problem for a simple cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular and semi-regular polytopes. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal bipartite matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity Patterns with High Rank Extremal Positive Semidefinite Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a positive semidefinite relaxation of the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sparsity order of a graph and its deficiency in chordality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real positive semidefinite completion problem for series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some geometric results in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic Spectrahedral Shadows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry / rank
 
Normal rank

Latest revision as of 14:59, 12 July 2024

scientific article
Language Label Description Also known as
English
Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
scientific article

    Statements

    Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors (English)
    0 references
    0 references
    0 references
    0 references
    16 September 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    extremal matrix
    0 references
    sparsity order
    0 references
    series-parallel graph
    0 references
    graphs without \(K_5\) minors
    0 references
    cut polytope
    0 references
    elliptope
    0 references
    0 references