Pages that link to "Item:Q1412950"
From MaRDI portal
The following pages link to Matrix completions and chordal graphs (Q1412950):
Displaying 13 items.
- The positive definite completion problem revisited (Q947605) (← links)
- Extending partial tournaments (Q969878) (← links)
- A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices (Q979016) (← links)
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming (Q999796) (← links)
- Minimizing the condition number of a positive definite matrix by completion (Q1347061) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- Numerical ranges and matrix completions (Q1583722) (← links)
- The positive definite completion problem relative to a subspace (Q1973913) (← links)
- Symmetric completions of cycles and bipartite graphs (Q2229479) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- Computational graph completion (Q2671739) (← links)
- (Q5456110) (← links)
- Triangular ranks do not bound minimum ranks in matrix completion (Q6631544) (← links)