Characterizing graphs with convex and connected Cayley configuration spaces (Q2380778): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solving Euclidean distance matrix completion problems via semidefinite progrmming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of graphs in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5818996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic global rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5449993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition plans for geometric constraint systems. I: Performance measures for CAD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition plans for geometric constraint problems. II: New algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing generic global rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for Unique Graph Realizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected rigidity matroids and unique realizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally linked pairs of vertices in equivalent realizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for two-dimensional rigidity percolation: The pebble game / 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: The non-solvability by radicals of generic 3-connected planar Laman graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Spaces and Positive Definite Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4914754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite programming approach to tensegrity theory and realizability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: WELL-CONSTRAINED COMPLETION AND DECOMPOSITION FOR UNDER-CONSTRAINED GEOMETRIC CONSTRAINT PROBLEMS / rank
 
Normal rank

Latest revision as of 15:57, 2 July 2024

scientific article
Language Label Description Also known as
English
Characterizing graphs with convex and connected Cayley configuration spaces
scientific article

    Statements

    Characterizing graphs with convex and connected Cayley configuration spaces (English)
    0 references
    0 references
    0 references
    12 April 2010
    0 references
    underconstrained geometric constraint system
    0 references
    mechanism
    0 references
    Cayley configuration space
    0 references
    combinatorial rigidity
    0 references
    linkage
    0 references
    framework
    0 references
    graph minor
    0 references
    graph characterization
    0 references
    distance geometry
    0 references
    convex
    0 references
    semidefinite and linear programming
    0 references
    algebraic complexity
    0 references

    Identifiers