Research map / Graph learning / Graph algorithms and clustering
Efficient Signed Graph Sampling via Balancing & Gershgorin Disc Perfect Alignment
Chinthaka Dinesh, Gene Cheung, Saghar Bagheri, Ivan V. Bajić
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
- A Poincaré Inequality and Consistency Results for Signal Sampling on Large Graphs (ICLR 2024 · similarity 0.88)
- Structure-Aware Spectral Sparsification via Uniform Edge Sampling (NeurIPS 2025 · similarity 0.85)
- Nonlinear Laplacians: Tunable principal component analysis under directional prior information (NeurIPS 2025 · similarity 0.84)
- WaveNet: Tackling Non-stationary Graph Signals via Graph Spectral Wavelets (AAAI 2024 · similarity 0.84)
- A Signed Graph Approach to Understanding and Mitigating Oversmoothing (NeurIPS 2025 · similarity 0.83)
- FastMAC: Stochastic Spectral Sampling of Correspondence Graph (CVPR 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.
