A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap (Q4917166)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap |
scientific article; zbMATH DE number 6159125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
29 April 2013
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
