scientific article; zbMATH DE number 554768
From MaRDI portal
Publication:4288584
zbMath0794.65019MaRDI QIDQ4288584
Robert Schreiber, Fernando L. Alvarado, Alex Pothen
Publication date: 31 August 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
directed acyclic graphgraph partitioningchordal graphtransitive closureelimination treesparse triangular systemspartitioned inverseconnection machine CM-2highly parallel algorithm
Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)
Related Items
A locally optimized reordering algorithm and its application to a parallel sparse linear system solver ⋮ A clique tree algorithm for partitioning a chordal graph into transitive subgraphs ⋮ Maximal and Maximum Transitive Relation Contained in a Given Binary Relation ⋮ A new efficient algorithm for computing Gröbner bases \((F_4)\) ⋮ The impact of high-performance computing in the solution of linear systems: Trends and problems ⋮ Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution