A divide-and-conquer bound for aggregate's quality and algebraic connectivity

DOI10.1016/j.disc.2017.05.003zbMath1367.05135OpenAlexW2466308708MaRDI QIDQ2012519

Artem Napov

Publication date: 1 August 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/230581/5/qual_difusion.pdf

zbMATH Keywords

algebraic connectivitygraph Laplacian eigenvaluesaggregate's qualitydivide-and-conquer bounds

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An aggregation-based algebraic multigrid method
• Laplace eigenvalues of graphs---a survey
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Old and new results on algebraic connectivity of graphs
• Laplacian matrices of graphs: A survey
• Towards algebraic multigrid for elliptic problems of second order
• Algebraic analysis of aggregation-based multigrid
• An Algebraic Multigrid Method with Guaranteed Convergence Rate
• Multi-level iterative technique and aggregation concept with semi-analytical preconditioning for solving boundary-value problems
• Aggregation-Based Algebraic Multigrid for Convection-Diffusion Equations
• An Efficient Multigrid Method for Graph Laplacian Systems II: Robust Aggregation

This page was built for publication: A divide-and-conquer bound for aggregate's quality and algebraic connectivity