An improvement of the Gibbs-Poole-Stockmeyer algorithm

DOI10.1260/1748-3018.4.3.325MaRDI QIDQ3065056zbMATH OpenOpenAlexFDO

Authors Feng Gu

Publication date 3 January 2011

Published in Journal of Algorithms & Computational Technology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1260/1748-3018.4.3.325

zbMATH Keywords

bandwidth reductionGibbs-Poole-Stockmeyer algorithmperipheral nodepseudo-peripheral nodesparse matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50)

Recommendations

• A New Algorithm for Finding a Pseudoperipheral Node in a Graph
• scientific article; zbMATH DE number 3880750
• scientific article; zbMATH DE number 4123315
• An alternative pseudoperipheral node finder for resequencing schemes
• scientific article; zbMATH DE number 3986532

Cited in

(4)

• scientific article; zbMATH DE number 3866469 (Why is no real title available?)
• scientific article; zbMATH DE number 3880750 (Why is no real title available?)
• An alternative pseudoperipheral node finder for resequencing schemes
• A Padé-based algorithm for overcoming the Gibbs phenomenon

This page was built for publication: An improvement of the Gibbs-Poole-Stockmeyer algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065056)