Graph rigidity via Euclidean distance matrices (Q1978125): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127629891, #quickstatements; #temporary_batch_1722266931810
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Abdo Y. Alfakih / rank
Normal rank
 
Property / author
 
Property / author: Abdo Y. Alfakih / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Euclidean distance matrix completion problems via semidefinite progrmming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rigidity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain linear mappings between inner-product and squared-distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Euclidean and non-Euclidean distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cone of distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for Unique Graph Realizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connections between the real positive semidefinite and distance matrix completion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs and rigidity of plane skeletal structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts, matrix completions and graph rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Generic Rigidity in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singular Points of Complex Hypersurfaces. (AM-61) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cone-LP's and semidefinite programs: Geometry and a simplex-type method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some geometric results in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigid and Flexible Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of optimization in matrix theory / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127629891 / rank
 
Normal rank

Latest revision as of 16:33, 29 July 2024

scientific article
Language Label Description Also known as
English
Graph rigidity via Euclidean distance matrices
scientific article

    Statements

    Graph rigidity via Euclidean distance matrices (English)
    0 references
    25 May 2000
    0 references
    rigidity
    0 references
    Euclidean distance matrices
    0 references
    semi-definite programming
    0 references
    normal cone
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references