Extending bootstrap AMG for clustering of attributed graphs
DOI10.1016/j.amc.2023.127904OpenAlexW4320033808MaRDI QIDQ2698212
Luisa Cutillo, Pasqua D'Ambra, Panayot S. Vassilevski
Publication date: 21 April 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.09367
Pattern recognition, speech recognition (68T10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55)
Uses Software
Cites Work
- Graph clustering
- Spectral methods for graph clustering - a survey
- Adaptive AMG with coarsening based on compatible weighted matching
- Community detection in node-attributed social networks: a survey
- Improving the Communication Pattern in Matrix-Vector Operations for Large Scale-Free Graphs by Disaggregation
- Multilevel Block Factorization Preconditioners
- BootCMatch
- Improving solve time of aggregation‐based adaptive AMG
- Fast unfolding of communities in large networks
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: Extending bootstrap AMG for clustering of attributed graphs