Pages that link to "Item:Q4394435"

The following pages link to An efficient algorithm for testing the generic rigidity of graphs in the plane (Q4394435):

Displaying 8 items.

• The unassigned distance geometry problem (Q266818) (← links)
• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (Q503659) (← links)
• Augmenting the rigidity of a graph in \(\mathbb R^{2}\) (Q627536) (← links)
• Combinatorial models of rigidity and renormalization (Q664590) (← links)
• An algorithm for two-dimensional rigidity percolation: The pebble game (Q1375495) (← links)
• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
• Efficient algorithms for the \(d\)-dimensional rigidity matroid of sparse graphs (Q2479473) (← links)
• An algorithm for an 𝓁²-homological test for the planarity of a graph (Q4956221) (← links)