Sparse hypergraphs with applications in combinatorial rigidity

DOI10.1016/j.dam.2014.12.020zbMath1311.05140OpenAlexW1975746527MaRDI QIDQ2341719

Viktória E. Kaszanitzky, Tibor Jordán

Publication date: 28 April 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.12.020

zbMATH Keywords

generic rigidityrigid frameworksparse hypergraphaffine rigidity

Mathematics Subject Classification ID

Hypergraphs (05C65) Density (toughness, etc.) (05C42)

Related Items (2)

Characterizing minimally flat symmetric hypergraphs ⋮ Double-distance frameworks and mixed sparsity graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Sparse hypergraphs and pebble game algorithms
• A matroid on hypergraphs, with applications in scene analysis and geometry
• ON AFFINE RIGIDITY
• Spectral Properties of the Alignment Matrices in Manifold Learning
• On Generic Rigidity in the Plane
• Lifting symmetric pictures to polyhedral scenes

This page was built for publication: Sparse hypergraphs with applications in combinatorial rigidity