On some properties of the Laplacian matrix revealed by the RCM algorithm.
From MaRDI portal
Publication:2828802
DOI10.1007/S10587-016-0281-YzbMATH Open1424.65054OpenAlexW2531779748MaRDI QIDQ2828802FDOQ2828802
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50)
Cites Work
- Matrix Analysis
- Title not available (Why is that?)
- Graph clustering
- Title not available (Why is that?)
- Depth-First Search and Linear Graph Algorithms
- Title not available (Why is that?)
- Handbook of Graph Theory
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Laplace eigenvalues and bandwidth‐type invariants of graphs
- Old and new results on algebraic connectivity of graphs
- Sparse Matrices in MATLAB: Design and Implementation
- Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
- Spectral methods for graph clustering - a survey
- Commute times for a directed graph using an asymmetric Laplacian
- Two improved algorithms for envelope and wavefront reduction
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
- Algebraic multigrid methods for Laplacians of graphs
- Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
- The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices
- Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
Uses Software
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)