Sparse graphs and an augmentation problem
From MaRDI portal
Recommendations
Cites work
- Algorithms for graph rigidity and scene analysis
- An algorithm for two-dimensional rigidity percolation: The pebble game
- Augmentation Problems
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- Brick partitions of graphs
- Combinatorial rigidity. Graphs and matroids in the theory of rigid frameworks
- Combined connectivity augmentation and orientation problems
- Conditions for Unique Graph Realizations
- Connections in combinatorial optimization
- Decomposition of Finite Graphs Into Forests
- Development of redundant rigidity theory for formation control
- Generic global rigidity of body-hinge frameworks
- Global rigidity of generic frameworks on the cylinder
- scientific article; zbMATH DE number 30657 (Why is no real title available?)
- scientific article; zbMATH DE number 952952 (Why is no real title available?)
- Linking (n-2)-dimensional panels in n-space. II: (n-2,2)-frameworks and body and Hinge structures
- On graphs and rigidity of plane skeletal structures
- On matroidal families
- On the hardness of approximating minimization problems
- Pebble game algorithms and sparse graphs
- Rigidity of Frameworks Supported on Surfaces
- Sparse graphs and an augmentation problem
- The Union of Matroids and the Rigidity of Frameworks
Cited in
(6)- Sparse graphs and an augmentation problem
- Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\)
- scientific article; zbMATH DE number 2185598 (Why is no real title available?)
- Globally rigid augmentation of rigid graphs
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- On finding augmenting graphs
This page was built for publication: Sparse graphs and an augmentation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041749)
