Pages that link to "Item:Q2476285"
From MaRDI portal
The following pages link to Pebble game algorithms and sparse graphs (Q2476285):
Displayed 14 items.
- Body-and-cad geometric constraint systems (Q448973) (← links)
- A proof of the molecular conjecture (Q540449) (← links)
- Bounded direction-length frameworks (Q542392) (← links)
- Slider-pinning rigidity: a Maxwell-Laman-type theorem (Q603881) (← links)
- Combinatorial models of rigidity and renormalization (Q664590) (← links)
- A rooted-forest partition with uniform vertex demand (Q695323) (← links)
- Rigidity, global rigidity, and graph decomposition (Q973100) (← links)
- Multitriangulations as complexes of star polygons (Q1017914) (← links)
- Mixed volume techniques for embeddings of Laman graphs (Q1037775) (← links)
- Sparse hypergraphs and pebble game algorithms (Q1041613) (← links)
- Sparsity-certifying graph decompositions (Q1043807) (← links)
- An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs (Q2867117) (← links)
- Proportional Contact Representations of Planar Graphs (Q5895512) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)