Pages that link to "Item:Q2248754"
From MaRDI portal
The following pages link to A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754):
Displaying 11 items.
- Graph cores via universal completability (Q322258) (← links)
- Typical ranks in symmetric matrix completion (Q1996075) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Unavoidable minors for graphs with large \(\ell_p\)-dimension (Q2039320) (← links)
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
- Sums of squares and quadratic persistence on real projective varieties (Q2119380) (← links)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
- Determinantal sampling designs (Q2317241) (← links)
- Universal completability, least eigenvalue frameworks, and vector colorings (Q2408207) (← links)
- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Q2848995) (← links)
- Selected Open Problems in Discrete Geometry and Optimization (Q2849006) (← links)
