Pebble game algorithms and sparse graphs (Q2476285): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045768640 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0702129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying and constructing minimally rigid graphs in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive characterizations for packing and covering with trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for Unique Graph Realizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Molecule Problem: Exploiting Structure in Global Optimization / 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: On graphs and rigidity of plane skeletal structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matroidal families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Generic Rigidity in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees and depth-first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigidity of multi-graphs. I: Linking rigid bodies in n-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Union of Matroids and the Rigidity of Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717849 / rank
 
Normal rank

Latest revision as of 18:45, 27 June 2024

scientific article
Language Label Description Also known as
English
Pebble game algorithms and sparse graphs
scientific article

    Statements

    Pebble game algorithms and sparse graphs (English)
    0 references
    0 references
    0 references
    18 March 2008
    0 references
    sparse graph
    0 references
    pebble game
    0 references
    Henneberg sequence
    0 references
    matroid
    0 references
    circuit
    0 references
    rigidity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references