An Implementation of a Pseudoperipheral Node Finder
From MaRDI portal
Publication:3869467
DOI10.1145/355841.355845zbMath0432.15002OpenAlexW1996121616MaRDI QIDQ3869467
No author found.
Publication date: 1979
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355841.355845
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
EVALUATION OF AUTOMATIC DOMAIN PARTITIONING ALGORITHMS FOR PARALLEL FINITE ELEMENT ANALYSIS ⋮ Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers ⋮ Stencil reduction algorithms for the local discontinuous Galerkin method ⋮ A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph ⋮ An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method ⋮ An algorithm for frontwidth reduction ⋮ A survey of direct methods for sparse linear systems ⋮ An evaluation of low-cost heuristics for matrix bandwidth and profile reductions ⋮ A linear time implementation of the reverse Cuthill-McKee algorithm ⋮ Unnamed Item ⋮ Finding pseudoperipheral nodes in graphs ⋮ Algorithms for the reduction of matrix bandwidth and profile
This page was built for publication: An Implementation of a Pseudoperipheral Node Finder
