Research map / Graph learning / Graph algorithms and clustering
An Approximation Algorithm for Graph Label Selection
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
- Algorithms and Hardness for Active Learning on Graphs (ICML 2025 · similarity 0.88)
- Approximating Optimal Labelings for Temporal Connectivity (AAAI 2025 · similarity 0.86)
- Mitigating Label Noise on Graphs via Topological Sample Selection (ICML 2024 · similarity 0.85)
- Improved Approximations for Hard Graph Problems using Predictions (ICML 2025 · similarity 0.85)
- Adjusted Count Quantification Learning on Graphs (NeurIPS 2025 · similarity 0.84)
- M3C: A Framework towards Convergent, Flexible, and Unsupervised Learning of Mixture Graph Matching and Clustering (ICLR 2024 · similarity 0.83)
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.