Minimum Cost Globally Rigid Subgraphs

DOI10.1007/978-3-662-59204-5_8zbMath1443.05046OpenAlexW3005429562MaRDI QIDQ3295269

András Mihálykó, Tibor Jordán

Publication date: 8 July 2020

Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-59204-5_8

zbMATH Keywords

approximation algorithmglobal rigidityrigid frameworkredundant rigidity

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Approximation algorithms (68W25)

Related Items (2)

Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\) ⋮ Sparse graphs and an augmentation problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
• Global rigidity: The effect of coning
• Connected rigidity matroids and unique realizations of graphs
• Generic global rigidity
• On graphs and rigidity of plane skeletal structures
• Development of redundant rigidity theory for formation control
• Characterizing generic global rigidity
• Conditions for Unique Graph Realizations
• The Rigidity of Graphs
• Decomposition of Finite Graphs Into Forests
• Algorithms - ESA 2003

This page was built for publication: Minimum Cost Globally Rigid Subgraphs