Pages that link to "Item:Q1124929"
From MaRDI portal
The following pages link to Methods for constructing distance matrices and the inverse eigenvalue problem (Q1124929):
Displaying 15 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- On Euclidean distance matrices (Q884414) (← links)
- On properties of cell matrices (Q979296) (← links)
- Euclidean graph distance matrices of generalizations of the star graph (Q1644108) (← links)
- Estimating the gap of finite metric spaces of strict \(p\)-negative type (Q1668994) (← links)
- A note on ``Methods for constructing distance matrices and the inverse eigenvalue problem'' (Q1758477) (← links)
- On the diagonal scaling of Euclidean distance matrices to doubly stochastic matrices (Q1774975) (← links)
- Semidefiniteness without real symmetry (Q1971047) (← links)
- On the inverse eigenvalue problem of symmetric nonnegative matrices (Q2184374) (← links)
- On unit spherical Euclidean distance matrices which differ in one entry (Q2310405) (← links)
- Inverse eigenvalue problem of distance matrix via orthogonal matrix (Q2448239) (← links)
- INVERSE EIGENVALUE PROBLEM FOR EUCLIDEAN DISTANCE MATRICES OF SIZE 3 (Q4909991) (← links)
- Distance matrices and quadratic embedding of graphs (Q5009968) (← links)
- An exact cutting plane method for the Euclidean max-sum diversity problem (Q6096568) (← links)
- Euclidean and circum-Euclidean distance matrices: characterizations and interlacing property (Q6638369) (← links)
