Skip to search formSkip to main contentSkip to account menu

Rigidity matroid

In the mathematics of structural rigidity, a rigidity matroid is a matroid that describes the number of degrees of freedom of an undirected graph… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Algebraic independenceBridge (graph theory)GradientGraphic matroid

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Constructive approaches to the rigidity of frameworks
La theorie de la rigidite etudie l'unicite des realisations des graphes, i.e., des charpentes. Initialement motivee par l… 
2012
2012
Lower Bound For The Rank Of 2-Dimensional Generic Rigidity Matroid For Regular Graphs Of Degree Four And Five
  • S. Luo
  • 2012
  • Corpus ID: 117189423
In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid for regular graphs of degree four and… 
2010
2010
Rigidity, global rigidity, and graph decomposition
2010
2010
Better Upper Bounds on the Rank of the 3 D Rigidity Matroid of a General Graph
It is a long open problem to combinatorially characterize the 3D bar-joint rigidity of graphs. The problem is at the intersection… 
2008
2008
Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs
2004
2004
ABSTRACT RIGIDITY IN m-SPACE
RIGIDITY IN m-SPACE JACK E. GRAVER, BRIGITTE SERVATIUS, AND HERMAN SERVATIUS Abstract. Matroid theory has many classical… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)