A New Algorithm for Finding a Pseudoperipheral Node in a Graph

DOI10.1137/0611022MaRDI QIDQ3474202zbMATH OpenOpenAlexFDO

Authors Roger. G. Grimes, Daniel J. Pierce, Horst 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

adjacency matrixbandwidth reductioneigenvalues of graphsGibbs-Poole-Stockmeyer algorithmpositive eigenvectorpseudoperipheral node in a graphreordering algorithmsreverse Cuthill-McKee algorithmsparse matrices

Mathematics Subject Classification ID

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

Recommendations

• Finding pseudoperipheral nodes in graphs
• A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
• scientific article; zbMATH DE number 4123315
• scientific article; zbMATH DE number 3972202
• scientific article; zbMATH DE number 3935082
• scientific article; zbMATH DE number 3880750
• A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
• An alternative pseudoperipheral node finder for resequencing schemes
• scientific article; zbMATH DE number 1247175
• A New Algorithm for Computing the Maximal Closure of a Graph

Cited in

(14)

• A new variant of the \(A^*\)-algorithm which closes a node at most once.
• Two improved algorithms for envelope and wavefront reduction
• An improvement of the Gibbs-Poole-Stockmeyer algorithm
• scientific article; zbMATH DE number 3861199 (Why is no real title available?)
• scientific article; zbMATH DE number 3880750 (Why is no real title available?)
• scientific article; zbMATH DE number 3935082 (Why is no real title available?)
• scientific article; zbMATH DE number 3972202 (Why is no real title available?)
• scientific article; zbMATH DE number 4026661 (Why is no real title available?)
• scientific article; zbMATH DE number 4123315 (Why is no real title available?)
• 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

Describes a project that uses

Uses Software

• Harwell-Boeing sparse matrix collection

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

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