Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
type: Item
instance of: scholarly article
title: Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
zbMATH Open document ID: 1213.68449
published in: Algorithmica
publication date: 2011-03-02T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C42
zbMATH DE Number: 5859351
zbMATH Keywords: rigid graph
zbMATH Keywords: Laman graph
zbMATH Keywords: augmenting problem
zbMATH Keywords: NP-completeness
author: Alfredo García
author: Javier Tejel
MaRDI profile type: Publication
full work available at URL: s00453-009-9300-9
OpenAlex ID: W2045638634
cites work: Edge-Connectivity Augmentation with Partition Constraints
cites work: A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
cites work: Algorithms - ESA 2003
cites work: Operations on rigid formations of autonomous agents
cites work: Augmentation Problems
cites work: Source location with rigidity and tree packing requirements
cites work: Rigid realizations of graphs on small grids
cites work: Algorithms – ESA 2004
cites work: Connectivity augmentation of networks: Structures and algorithms. Papers from the workshop held at Eötvös University, Budapest, Hungary, November 1994
cites work: Incrementing bipartite digraph edge-connectivity
cites work: Q4198056
cites work: Q4076414
cites work: Q4279195
cites work: Planar minimally rigid graphs and pseudo-triangulations
cites work: Conditions for Unique Graph Realizations
cites work: Q4230328
cites work: Connected rigidity matroids and unique realizations of graphs
cites work: An algorithm for two-dimensional rigidity percolation: The pebble game
cites work: Augmenting Outerplanar Graphs
cites work: On graphs and rigidity of plane skeletal structures
cites work: Q3576685
cites work: An efficient algorithm for testing the generic rigidity of graphs in the plane
cites work: Q4000391
cites work: Birigidity in the Plane
cites work: Acute triangulations of polygons
cites work: On Some Problems in the Design of Plane Skeletal Structures
cites work: Edge-connectivity augmentation problems
cites work: A smallest augmentation to 3-connect a graph
DOI: 10.1007/S00453-009-9300-9
description: scientific article; zbMATH DE number 5859351