The real positive semidefinite completion problem for series-parallel graphs (Q676039): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On cuts and matchings in planar graphs / 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 for a simple cycle / 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: Geometry. I, II. Transl. from the French by M. Cole and S. Levy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on extreme positive definite matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for the cut cone. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for the cut cone. II: Clique-web inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: .879-approximation algorithms for MAX CUT and MAX 2SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: All facets of the cut cone \(C_ n\) for \(n=7\) are known / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive definite completions of partial Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal correlation matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural conditions for cycle completable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-third-integrality in the max-cut problem / 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 Facial Structure of the Set of Correlation Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connection between semidefinite relaxations of the max-cut and stable set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Extreme Correlation Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme points of a convex subset of the cone of positive semidefinite matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpolyhedral Relaxations of Graph-Bisection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840774 / rank
 
Normal rank

Latest revision as of 10:48, 27 May 2024

scientific article
Language Label Description Also known as
English
The real positive semidefinite completion problem for series-parallel graphs
scientific article

    Statements

    The real positive semidefinite completion problem for series-parallel graphs (English)
    0 references
    0 references
    11 May 1997
    0 references
    The author considers the partial real symmetric matrices \(X\) whose diagonal entries are equal to 1 and off-diagonal entries are specified only on a subset of the positions. The author gives a set of necessary conditions for \(X\) to be completable to a positive semidefinite matrix, and shows that these conditions are also sufficient if and only if the graph corresponding to the positions of the specified entries has no \(K_4\)-minor.
    0 references
    real symmetric matrices
    0 references
    positive semidefinite matrix
    0 references

    Identifiers