Generalizing Lloyd's algorithm for graph clustering
From MaRDI portal
(Redirected from Publication:6598501)
Generalizing Lloyd's algorithm for graph clustering (scientific article; zbMATH DE number 7906819)
Generalizing Lloyd's algorithm for graph clustering (scientific article; zbMATH DE number 7906819)
Cites work
- A Multigrid Tutorial, Second Edition
- A new perspective on strength measures in algebraic multigrid
- A root-node-based algebraic multigrid method
- Acceleration of convergence of a two-level algebraic algorithm by aggregation in smoothing process
- Acceleration of convergence of a two-level algorithm by smoothing transfer operators
- Adaptive Multiscale Redistribution for Vector Quantization
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs
- An aggregation-based algebraic multigrid method
- An algebraic multigrid method with guaranteed convergence rate
- Convergence of algebraic multigrid based on smoothed aggregation
- Exposing fine-grained parallelism in algebraic multigrid methods
- Firedrake, automating the finite element method by composing abstractions
- Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 1561761 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Least squares quantization in PCM
- Theoretical bounds for algebraic multigrid performance: review and analysis.
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)
