Augmenting the rigidity of a graph in \(\mathbb R^{2}\) (Q627536): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Edge-Connectivity Augmentation with Partition Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations on rigid formations of autonomous agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Source location with rigidity and tree packing requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigid realizations of graphs on small grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity augmentation of networks: Structures and algorithms. Papers from the workshop held at Eötvös University, Budapest, Hungary, November 1994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incrementing bipartite digraph edge-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4076414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar minimally rigid graphs and pseudo-triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for Unique Graph Realizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected rigidity matroids and unique realizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for two-dimensional rigidity percolation: The pebble game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs and rigidity of plane skeletal structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for testing the generic rigidity of graphs in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Birigidity in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acute triangulations of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Problems in the Design of Plane Skeletal Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity augmentation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smallest augmentation to 3-connect a graph / rank
 
Normal rank

Latest revision as of 20:27, 3 July 2024

scientific article
Language Label Description Also known as
English
Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
scientific article

    Statements

    Augmenting the rigidity of a graph in \(\mathbb R^{2}\) (English)
    0 references
    0 references
    2 March 2011
    0 references
    0 references
    rigid graph
    0 references
    Laman graph
    0 references
    augmenting problem
    0 references
    NP-completeness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references