Generalizing Lloyd's algorithm for graph clustering
From MaRDI portal
Publication:6598501
DOI10.1137/23M1556800MaRDI QIDQ6598501
Matthew West, Tareq Zaman, Nicolas Nytko, Luke N. Olson, Scott MacLachlan, Ali Taghibakhshi
Publication date: 5 September 2024
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Statistics (62-XX) Discrete mathematics in relation to computer science (68Rxx) Combinatorics (05-XX)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An aggregation-based algebraic multigrid method
- Acceleration of convergence of a two-level algorithm by smoothing transfer operators
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- Acceleration of convergence of a two-level algebraic algorithm by aggregation in smoothing process
- Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs
- An Algebraic Multigrid Method with Guaranteed Convergence Rate
- A new perspective on strength measures in algebraic multigrid
- Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods
- Firedrake
- Gmsh: A 3-D finite element mesh generator with built-in pre- and post-processing facilities
- A Multigrid Tutorial, Second Edition
- Least squares quantization in PCM
- A Root-Node--Based Algebraic Multigrid Method
- Adaptive Multiscale Redistribution for Vector Quantization
- Theoretical bounds for algebraic multigrid performance: review and analysis
- Convergence of algebraic multigrid based on smoothed aggregation
This page was built for publication: Generalizing Lloyd's algorithm for graph clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6598501)
