Research map / Graph learning / Graph algorithms and clustering
Fast and Scalable Hashing-Based Universal Graph Coarsening
Mohit Kataria, Nikita Malik, Jayadeva, Sandeep Kumar
Read the paperCheck your idea against 137,217 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
- UGC: Universal Graph Coarsening (NeurIPS 2024 · similarity 0.92)
- Featured Graph Coarsening with Similarity Guarantees (ICML 2023 · similarity 0.90)
- Adapting to Evolving Graphs: A Scalable Framework for Dynamic Coarsening (ICML 2026 · similarity 0.90)
- Graph Coarsening with Neural Networks (ICLR 2021 · similarity 0.89)
- Bi-Directional Multi-Scale Graph Dataset Condensation via Information Bottleneck (AAAI 2025 · similarity 0.86)
- New Parallel and Streaming Algorithms for Directed Densest Subgraph (NeurIPS 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.
