Pages that link to "Item:Q3083321"
From MaRDI portal
The following pages link to Universal Rigidity and Edge Sparsification for Sensor Network Localization (Q3083321):
Displaying 19 items.
- Comparing SOS and SDP relaxations of sensor network localization (Q694515) (← links)
- The m-Bézout bound and distance geometry (Q831957) (← links)
- Geometric buildup algorithms for sensor network localization (Q1955353) (← links)
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs (Q2025442) (← links)
- New upper bounds for the number of embeddings of minimally rigid graphs (Q2172653) (← links)
- Generically globally rigid graphs have generic universally rigid frameworks (Q2182252) (← links)
- On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\) (Q2200306) (← links)
- Iterative universal rigidity (Q2351022) (← links)
- On the number of realizations of certain Henneberg graphs arising in protein conformation (Q2448906) (← links)
- Mechanism creation in tensegrity structures by cellular morphogenesis (Q2661119) (← links)
- Selected Open Problems in Discrete Geometry and Optimization (Q2849006) (← links)
- Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs (Q2907493) (← links)
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)
- Lower Bounds on the Number of Realizations of Rigid Graphs (Q5114449) (← links)
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization (Q5189557) (← links)
- The Tropical Cayley--Menger Variety (Q5234661) (← links)
- Global Registration of Multiple Point Clouds Using Semidefinite Programming (Q5252586) (← links)
- Low-Distortion Inference of Latent Similarities from a Multiplex Social Network (Q5255011) (← links)
- Singularity Degree of the Positive Semidefinite Matrix Completion Problem (Q5737737) (← links)
