A New Algorithm for Finding a Pseudoperipheral Node in a Graph

DOI10.1137/0611022zbMath0696.65023OpenAlexW2014256025MaRDI QIDQ3474202

Daniel J. Pierce, Roger. G. Grimes, Horst D. Simon

Publication date: 1990

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0611022

zbMATH Keywords

sparse matricesadjacency matrixpositive eigenvectorbandwidth reductioneigenvalues of graphsreverse Cuthill-McKee algorithmreordering algorithmsGibbs-Poole-Stockmeyer algorithmpseudoperipheral node in a graph

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (6)

Two improved algorithms for envelope and wavefront reduction ⋮ A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph ⋮ Finite element nodal ordering algorithms ⋮ Nodal ordering for bandwidth reduction using ant system algorithm ⋮ A survey of direct methods for sparse linear systems ⋮ Combinatorial optimization of special graphs for nodal ordering and graph partitioning

Uses Software

• Harwell-Boeing sparse matrix collection

This page was built for publication: A New Algorithm for Finding a Pseudoperipheral Node in a Graph