Research map / Graph learning / Graph algorithms and clustering
Estimating Correlation Clustering Cost in Node-Arrival Stream
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost (NeurIPS 2023 · similarity 0.93)
- Learning-Augmented Streaming Algorithms for Correlation Clustering (NeurIPS 2025 · similarity 0.92)
- Dynamic Correlation Clustering in Sublinear Update Time (ICML 2024 · similarity 0.90)
- Efficient Testing for Correlation Clustering: Improved Algorithms and Optimal Bounds (ICLR 2026 · similarity 0.89)
- Sparse-pivot: Dynamic correlation clustering for node insertions (ICML 2025 · similarity 0.87)
- Hierarchical Overlapping Clustering on Graphs: Cost Function, Algorithm and Scalability (ICML 2025 · similarity 0.86)
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.