Pages that link to "Item:Q1375495"
From MaRDI portal
The following pages link to An algorithm for two-dimensional rigidity percolation: The pebble game (Q1375495):
Displaying 48 items.
- The unassigned distance geometry problem (Q266818) (← links)
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks (Q273172) (← links)
- Maxwell-independence: a new rank estimate for the 3-dimensional generic rigidity matroid (Q401493) (← links)
- A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid (Q404444) (← links)
- Geometric analysis characterizes molecular rigidity in generic and non-generic protein configurations (Q497387) (← links)
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (Q503659) (← links)
- When is a symmetric pin-jointed framework isostatic? (Q545028) (← links)
- A linear programming algorithm to test for jamming in hard-sphere packings (Q598132) (← links)
- Symmetric versions of Laman's theorem (Q603868) (← links)
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\) (Q627536) (← links)
- Combinatorial models of rigidity and renormalization (Q664590) (← links)
- The frictional pebble game: an algorithm for rigidity percolation in saturated frictional assemblies (Q725485) (← links)
- Combining globally rigid frameworks (Q741178) (← links)
- Enumerating constrained non-crossing minimally rigid frameworks (Q946684) (← links)
- Combinatorial characterization of the Assur graphs from engineering (Q973098) (← links)
- Sparse hypergraphs and pebble game algorithms (Q1041613) (← links)
- Sparsity-certifying graph decompositions (Q1043807) (← links)
- Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials (Q1632383) (← links)
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
- Combinatorial rigidity of incidence systems and application to dictionary learning (Q1745767) (← links)
- Token graphs (Q1926040) (← links)
- Multi-color pebble motion on graphs (Q1957647) (← links)
- When is a symmetric body-bar structure isostatic? (Q1960018) (← links)
- The number of circles of a maximum state of a plane graph with applications (Q2025183) (← links)
- Assur decompositions of direction-length frameworks (Q2056896) (← links)
- Topological inductive constructions for tight surface graphs (Q2084791) (← links)
- Sparse graphs and an augmentation problem (Q2118121) (← links)
- Inductive constructions for frameworks on a two-dimensional fixed torus (Q2354675) (← links)
- Enumerating non-crossing minimally rigid frameworks (Q2373440) (← links)
- Characterizing graphs with convex and connected Cayley configuration spaces (Q2380778) (← links)
- Pebble game algorithms and sparse graphs (Q2476285) (← links)
- The rigidity of periodic body–bar frameworks on the three-dimensional fixed torus (Q2955602) (← links)
- A remark on global positioning from local distances (Q3075549) (← links)
- Stable Camera Motion Estimation Using Convex Programming (Q3192651) (← links)
- Combinatorial Rigidity and Independence of Generalized Pinned Subspace-Incidence Constraint Systems (Q3452284) (← links)
- The Number of Realizations of a Laman Graph (Q4564015) (← links)
- Rigid Graph Compression: Motif-Based Rigidity Analysis for Disordered Fiber Networks (Q4689152) (← links)
- (Q5026948) (← links)
- FlexRiLoG—A SageMath Package for Motions of Graphs (Q5041080) (← links)
- Sparse Graphs and an Augmentation Problem (Q5041749) (← links)
- Generic Symmetry-Forced Infinitesimal Rigidity: Translations and Rotations (Q5073710) (← links)
- (Q5075827) (← links)
- Rigidity for sticky discs (Q5160632) (← links)
- Deterministic and stochastic control of kirigami topology (Q5854815) (← links)
- Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane (Q6074574) (← links)
- Coupler curves of moving graphs and counting realizations of rigid graphs (Q6076254) (← links)
- Exploring the rigidity of planar configurations of points and rods (Q6103477) (← links)
- Sharp threshold for rigidity of random graphs (Q6135068) (← links)