Directed graphs, decompositions, and spatial linkages

DOI10.1016/j.dam.2013.06.004zbMath1287.05055arXiv1010.5552OpenAlexW2109468620MaRDI QIDQ2446895

Adnan Sljoka, Offer Shai, Walter J. Whiteley

Publication date: 23 April 2014

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

Full work available at URL: https://arxiv.org/abs/1010.5552

zbMATH Keywords

decompositiondirected graphassur graphsisostatic framework

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items

New upper bounds for the number of embeddings of minimally rigid graphs ⋮ Assur decompositions of direction-length frameworks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relative centers of motion, implicit bars and dead-center positions for planar mechanisms
• Combinatorial characterization of the Assur graphs from engineering
• Geometric properties of Assur graphs
• Position analysis in polynomial form of planar mechanisms with Assur groups of class 3 including revolute and prismatic joints.
• Pebble game algorithms and sparse graphs
• Chebychev-Grübler-Kutzbach's criterion for mobility calculation of multi-loop mechanisms revisited via theory of linear transformations
• CONSTRAINTS ON SIMPLE GEOMETRY IN TWO AND THREE DIMENSIONS
• The Algebraic Geometry of Motions of Bar-and-Body Frameworks
• ON GENERAL PHYSICAL SYSTEMS THEORIES
• The Rigidity of Graphs
• Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries
• Depth-First Search and Linear Graph Algorithms
• Decomposition plans for geometric constraint systems. I: Performance measures for CAD
• Decomposition plans for geometric constraint problems. II: New algorithms