Critical Graphs for the Positive Definite Completion Problem
From MaRDI portal
Publication:4243496
Recommendations
- The positive definite completion problem revisited
- The cycle completable graphs for the completely positive and doubly nonnegative completion problems
- scientific article; zbMATH DE number 2202148
- On completely positive graphs and their complements
- The real positive semidefinite completion problem for series-parallel graphs
- The completable digraphs for the totally nonnegative completion problem
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
- A note on completely positive graphs
- The completely positive and doubly nonnegative completion problems
- A new graph parameter related to bounded rank positive semidefinite matrix completions
Cited in
(6)- Linearly constrained positive definite completions
- Null spaces of correlation matrices
- scientific article; zbMATH DE number 2202148 (Why is no real title available?)
- The cycle completable graphs for the completely positive and doubly nonnegative completion problems
- Symmetric completions of cycles and bipartite graphs
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
This page was built for publication: Critical Graphs for the Positive Definite Completion Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243496)