Pages that link to "Item:Q1041613"
From MaRDI portal
The following pages link to Sparse hypergraphs and pebble game algorithms (Q1041613):
Displaying 14 items.
- Body-and-cad geometric constraint systems (Q448973) (← links)
- Multitriangulations as complexes of star polygons (Q1017914) (← links)
- Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials (Q1632383) (← links)
- Combinatorial rigidity of incidence systems and application to dictionary learning (Q1745767) (← links)
- Sparse graphs and an augmentation problem (Q2118121) (← links)
- New upper bounds for the number of embeddings of minimally rigid graphs (Q2172653) (← links)
- Sparse hypergraphs with applications in combinatorial rigidity (Q2341719) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- Combinatorial Rigidity and Independence of Generalized Pinned Subspace-Incidence Constraint Systems (Q3452284) (← links)
- Globally Rigid Augmentation of Rigid Graphs (Q5043054) (← links)
- Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
- (Q5753770) (← links)
- On the target pebbling conjecture (Q6616817) (← links)
- Volume rigidity and algebraic shifting (Q6652094) (← links)
