A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap (Q4917166)

From MaRDI portal
Revision as of 07:34, 8 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 6159125
Language Label Description Also known as
English
A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap
scientific article; zbMATH DE number 6159125

    Statements

    A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    sparse square matrices
    0 references
    block diagonal form with overlap
    0 references
    graph partitioning by vertex separator
    0 references
    recursive bipartitioning
    0 references
    partitioning with fixed vertices
    0 references
    combinatorial scientific computing
    0 references