Properties of the graph modularity matrix and its applications

DOI10.1515/CMAM-2025-0177MaRDI QIDQ7249692zbMATH OpenFDO

Authors Benjamin Quiring, Panayot S. Vassilevski

Publication date 19 May 2026

Published in Computational Methods in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/CMAM-2025-0177

zbMATH Keywords

graph modularitygraphsmultilevel algorithms

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Cites work

• A Parallel Graph Coloring Heuristic
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Adaptive Algebraic Multigrid
• Adaptive AMG with coarsening based on compatible weighted matching
• Adaptive Smoothed Aggregation (\alphaSA) Multigrid
• AMG Preconditioners for Linear Solvers towards Extreme Scale
• Bootstrap AMG
• Fast unfolding of communities in large networks: 15 years later
• Networks. An introduction.

This page was built for publication: Properties of the graph modularity matrix and its applications

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