Sparsity-certifying graph decompositions (Q1043807): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 0704.0002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matroid approach to finding edge connectivity and packing arborescences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forests, frames, and games: Algorithms for matroid sums and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Sparse Graphs by Map Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for Unique Graph Realizations / 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: Pebble game algorithms and sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / 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: Combinatorial genericity and minimal rigidity / 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: A new proof of Laman's theorem / 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

Latest revision as of 06:19, 2 July 2024

scientific article
Language Label Description Also known as
English
Sparsity-certifying graph decompositions
scientific article

    Statements

    Sparsity-certifying graph decompositions (English)
    0 references
    0 references
    0 references
    9 December 2009
    0 references
    sparse graph algorithm
    0 references
    tree decompositions
    0 references
    matroids
    0 references
    pebble game algorithm
    0 references

    Identifiers

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