The real positive semidefinite completion problem for series-parallel graphs

DOI10.1016/0024-3795(95)00741-5MaRDI QIDQ676039zbMATH OpenOpenAlexFDO

Authors Monique Laurent

Publication date 11 May 1997

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/5067

zbMATH Keywords

positive semidefinite matrixreal symmetric matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• The real positive definite completion problem: cycle completability
• The real positive definite completion problem for a simple cycle
• The totally positive completion problem
• The real positive definite completion problem for a 4-cycle

Cites work

• scientific article; zbMATH DE number 4158856 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 780784 (Why is no real title available?)
• .878-approximation algorithms for MAX CUT and MAX 2SAT
• A Note on Extreme Correlation Matrices
• A note on extreme positive definite matrices
• All facets of the cut cone \(C_ n\) for \(n=7\) are known
• Connection between semidefinite relaxations of the max-cut and stable set problems
• Extremal correlation matrices
• Extreme points of a convex subset of the cone of positive semidefinite matrices
• Facets for the cut cone. I
• Facets for the cut cone. II: Clique-web inequalities
• Geometry. I, II. Transl. from the French by M. Cole and S. Levy
• Matrix inequalities
• Nonpolyhedral Relaxations of Graph-Bisection Problems
• On a positive semidefinite relaxation of the cut polytope
• On cuts and matchings in planar graphs
• On the Facial Structure of the Set of Correlation Matrices
• On the cut polytope
• One-third-integrality in the max-cut problem
• Positive definite completions of partial Hermitian matrices
• Structural conditions for cycle completable graphs
• The real positive definite completion problem for a simple cycle
• The real positive definite completion problem: cycle completability
• Topology of series-parallel networks

Cited in

(21)

• SPN completable graphs
• Singularity degree of the positive semidefinite matrix completion problem
• A new graph parameter related to bounded rank positive semidefinite matrix completions
• Positive semidefinite completions of partial Hermitian matrices
• Critical Graphs for the Positive Definite Completion Problem
• Cuts, matrix completions and graph rigidity
• A parameterization of positive definite matrices in terms of partial correlation vines
• On Sidorenko's conjecture for determinants and Gaussian Markov random fields
• A connection between positive semidefinite and Euclidean distance matrix completion problems
• An efficient algorithm for maximum entropy extension of block-circulant covariance matrices
• Computing the Grothendieck constant of some graph classes
• A maximum entropy approach to the realizability of spin correlation matrices
• A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs
• Complexity of the positive semidefinite matrix completion problem with a rank constraint
• Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
• Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
• Do sums of squares dream of free resolutions?
• Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
• Graph-Based Representations in Pattern Recognition
• Completion problem with partial correlation vines
• Positive semidefinite matrix completion, universal rigidity and the strong Arnold property

This page was built for publication: The real positive semidefinite completion problem for series-parallel graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676039)