Research map / Graph learning / Graph algorithms and clustering
Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
The paper proposes a correlation clustering algorithm (Pruned Pivot) for dynamic, parallel, and local computation models, but the provided text is only the ICML 2024 style template, so the content is unknown.
Problem
Correlation clustering on graphs with positive and negative edge labels, studied under dynamic, parallel, and local computation models (from the title and abstract stub only).
Approach
Unknown from provided text; the body is the ICML formatting template rather than the paper's method. The title suggests a pruned variant of the pivot algorithm.
Limitations
- Full paper text not provided; only the ICML template was supplied
Experimental setup
Builds on: pivot algorithm
Closest papers by meaning
- Correlation Clustering Beyond the Pivot Algorithm (ICML 2025 · similarity 0.91)
- Sparse-pivot: Dynamic correlation clustering for node insertions (ICML 2025 · similarity 0.91)
- Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering (NeurIPS 2025 · similarity 0.89)
- Dynamic Correlation Clustering in Sublinear Update Time (ICML 2024 · similarity 0.88)
- Towards Better-than-2 Approximation for Constrained Correlation Clustering (ICML 2025 · similarity 0.87)
- Learning-Augmented Streaming Algorithms for Correlation Clustering (NeurIPS 2025 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.