On some properties of the Laplacian matrix revealed by the RCM algorithm

DOI10.1007/s10587-016-0281-yzbMath1424.65054OpenAlexW2531779748MaRDI QIDQ2828802

Francisco Pedroche, Alberto Palomares, Carlos Carrascosa, Miguel Rebollo

Publication date: 26 October 2016

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/80857

zbMATH Keywords

graph partitioningLaplacian matrixordering algorithmreverse Cuthill-McKee algorithm

Mathematics Subject Classification ID

Uses Software

• Matlab
• SPARSPAK
• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph clustering
• Spectral methods for graph clustering - a survey
• Old and new results on algebraic connectivity of graphs
• Two improved algorithms for envelope and wavefront reduction
• Algebraic multigrid methods for Laplacians of graphs
• Commute times for a directed graph using an asymmetric Laplacian
• The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Matrix Analysis
• Sparse Matrices in MATLAB: Design and Implementation
• Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
• Laplace eigenvalues and bandwidth‐type invariants of graphs
• Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
• Handbook of Graph Theory
• Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
• Depth-First Search and Linear Graph Algorithms
• Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices

This page was built for publication: On some properties of the Laplacian matrix revealed by the RCM algorithm