An Application of Generalized Tree Pebbling to Sparse Matrix Factorization (Q3773170): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storage requirements for deterministic polynomial time recognizable languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multifrontal Solution of Indefinite Sparse Symmetric Linear / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pebbling Problem is Complete in Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-white pebbles and graph separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space complexity of pebble games on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically tight bounds on time-space trade-offs in a pebble game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the storage requirement in the out-of-core multifrontal method for sparse factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compact row storage scheme for Cholesky factors using elimination trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of two variations of a pebble game on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Implementation of Sparse Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank
 
Normal rank

Latest revision as of 14:07, 18 June 2024

scientific article
Language Label Description Also known as
English
An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
scientific article

    Statements

    An Application of Generalized Tree Pebbling to Sparse Matrix Factorization (English)
    0 references
    0 references
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    elimination tree
    0 references
    tree pebbling
    0 references
    out-of-core Cholesky factorization
    0 references
    pebble game for rooted trees
    0 references
    multifrontal method
    0 references
    storage reduction
    0 references
    0 references
    0 references
    0 references