Research map / Graph learning / Graph algorithms and clustering
Dynamic Kernel Graph Sparsifiers
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
- Spectral Graph Sparsification Preserves Representation Geometry in Graph Neural Networks (NeurIPS 2026 · similarity 0.87)
- Dynamic Similarity Graph Construction with Kernel Density Estimation (ICML 2025 · similarity 0.87)
- Structure-Aware Spectral Sparsification via Uniform Edge Sampling (NeurIPS 2025 · similarity 0.86)
- General Graph Random Features (ICLR 2024 · similarity 0.85)
- Taxonomy of reduction matrices for Graph Coarsening (NeurIPS 2025 · similarity 0.85)
- Nonlinear Laplacians: Tunable principal component analysis under directional prior information (NeurIPS 2025 · similarity 0.85)
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.