arXiv (All)
open access
GraCo: A Unified Toolkit of Graph Coarsening Algorithms and Metrics
Graph coarsening aims to reduce a graph to a smaller one that preserves chosen properties of the original. It is increasingly used to scale graph learning to large graphs, as a non-differentiable step applied once before training. Many coarsening methods have been proposed in recent years, each with
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Scalable and Adaptive Parallel Training of Graph Transformer on Large Graphs#120488
- DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System#394373
- Learning Generalized Hessian on Graphs for Continuous Graph Learning#667015
- Trust-But-Verify: Poisoning-Resilient Locally Private Graph Learning Protocols#975127
- Graph-Based Gene Genomics Analysis#632394
Record · ID 1537007
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive