Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\)

DOI10.1007/978-3-030-75242-2_23OpenAlexW3159261000MaRDI QIDQ2692732

András Mihálykó, Csaba Király

Publication date: 22 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_23

zbMATH Keywords

augmentationrigiditycombinatorial algorithmglobal rigidity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
• Connected rigidity matroids and unique realizations of graphs
• On the optimal vertex-connectivity augmentation
• Generic global rigidity
• On graphs and rigidity of plane skeletal structures
• Minimum Cost Globally Rigid Subgraphs
• Characterizing generic global rigidity
• Dividing a Graph into Triconnected Components
• Sparse Graphs and an Augmentation Problem
• Formal Theory of Noisy Sensor Network Localization
• Algorithms - ESA 2003

This page was built for publication: Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\)