A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph

DOI10.1002/cnm.1640101107zbMath0834.05039OpenAlexW2168238367MaRDI QIDQ4315432

Ivan F. M. Menezes, Glaucio H. Paulino, Marcelo Gattass, Subrata Mukherjee

Publication date: 14 November 1995

Published in: Communications in Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cnm.1640101107

zbMATH Keywords

algorithmendpointsLaplacian matrix of a graphspectral graphsparse matrix equationspseudodiameterpseudoperipheral vertex

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10) Matrix equations and identities (15A24) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

EVALUATION OF AUTOMATIC DOMAIN PARTITIONING ALGORITHMS FOR PARALLEL FINITE ELEMENT ANALYSIS ⋮ Topology and graph products; eigenproblems in optimal structural analysis ⋮ Level-based heuristics and hill climbing for the antibandwidth maximization problem

Uses Software

• symrcm
• profile wavefront

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding pseudoperipheral nodes in graphs
• Algorithms for the reduction of matrix bandwidth and profile
• Computing extremal and approximate distances in graphs having unit cost edges
• Note on minimizing the bandwidth of sparse, symmetric matrices
• A New Algorithm for Finding a Pseudoperipheral Node in a Graph
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Lanczos versus subspace iteration for solution of eigenvalue problems
• Eigenvalues of the Laplacian of a graph^∗
• Sparse matrix test problems
• An Implementation of a Pseudoperipheral Node Finder
• Linear Algebra in Geography: Eigenvectors of Networks
• Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
• An equation numbering algorithm based on a minimum front criteria
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
• Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
• Algebraic graph theory for ordering
• A two‐step approach to finite element ordering
• A FORTRAN program for profile and wavefront reduction

This page was built for publication: A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph