Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs

DOI10.1016/j.ipl.2015.08.011zbMath1347.05110OpenAlexW1455926517MaRDI QIDQ894472

Adnan Sljoka, Naoki Katoh, Yuki Kobayashi, Yuya Higashikawa

Publication date: 1 December 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.08.011

zbMATH Keywords

algorithmscombinatorial rigiditybody-hinge graphedge connectivityglobal rigiditymixed connectivityredundant rigidity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Certifying 3-edge-connectivity
• A proof of the molecular conjecture
• Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
• Generic global rigidity of body-hinge frameworks
• Rigidity, global rigidity, and graph decomposition
• A sufficient connectivity condition for generic rigidity in the plane
• A linear time algorithm for computing 3-edge-connected components in a multigraph
• On graphs and rigidity of plane skeletal structures
• Linking (n-2)-dimensional panels in n-space. II: (n-2,2)-frameworks and body and Hinge structures
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Algorithmic Aspects of Graph Connectivity
• The Algebraic Geometry of Motions of Bar-and-Body Frameworks
• The Union of Matroids and the Rigidity of Frameworks
• On Generic Rigidity in the Plane
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time

This page was built for publication: Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs