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

DOI10.1007/S10587-016-0281-YMaRDI QIDQ2828802zbMATH OpenOpenAlexFDO

Authors Francisco Pedroche, Carlos Carrascosa, Alberto Palomares, 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, http://hdl.handle.net/10338.dmlcz/145860

zbMATH Keywords

Laplacian matrixgraph partitioningordering algorithmreverse Cuthill-McKee algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3986532
• scientific article; zbMATH DE number 1442000
• An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
• The Laplacian eigenvalues and invariants of graphs
• scientific article; zbMATH DE number 4208110

Cites work

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

Describes a project that uses

Uses Software

• symrcm
• SPARSPAK
• Matlab

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

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