{"total":54,"rows":[{"id":"2110.07580","title":"Graph Condensation for Graph Neural Networks","created":"2021-10-14","cited_by_count":150,"area":null},{"id":"2402.03358","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","created":"2024-01-29","cited_by_count":57,"area":null},{"id":"2102.01350","title":"Graph Coarsening with Neural Networks","created":"2021-02-02","cited_by_count":55,"area":null},{"id":"2211.08854","title":"Graph Filters for Signal Processing and Machine Learning on Graphs","created":"2022-11-16","cited_by_count":53,"area":null},{"id":"2310.09192","title":"Does Graph Distillation See Like Vision Dataset Counterpart?","created":"2023-10-13","cited_by_count":45,"area":null},{"id":"2207.07888","title":"SizeShiftReg: a Regularization Method for Improving Size-Generalization in Graph Neural Networks","created":"2022-07-16","cited_by_count":37,"area":null},{"id":"2312.11529","title":"Efficient and Scalable Graph Generation through Iterative Local Expansion","created":"2023-12-14","cited_by_count":36,"area":null},{"id":"2307.15967","title":"Graph Condensation for Inductive Node Representation Learning","created":"2023-07-29","cited_by_count":31,"area":null},{"id":"2401.11720","title":"Graph Condensation: A Survey","created":"2024-01-22","cited_by_count":23,"area":null},{"id":"2405.13707","title":"Rethinking and Accelerating Graph Condensation: A Training-Free Approach with Class Partition","created":"2024-05-22","cited_by_count":23,"area":null},{"id":"2310.04987","title":"Data-centric Graph Learning: A Survey","created":"2023-10-08","cited_by_count":22,"area":null},{"id":"2207.08629","title":"Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks","created":"2022-07-18","cited_by_count":18,"area":null},{"id":"2306.14052","title":"A Survey on Graph Neural Network Acceleration: Algorithms, Systems, and Customized Hardware","created":"2023-06-24","cited_by_count":18,"area":null},{"id":"2306.08854","title":"A Gromov--Wasserstein Geometric View of Spectrum-Preserving Graph Coarsening","created":"2023-06-15","cited_by_count":15,"area":null},{"id":"2107.01952","title":"Partition and Code: learning how to compress graphs","created":"2021-07-05","cited_by_count":10,"area":null},{"id":"2110.14266","title":"SQALER: Scaling Question Answering by Decoupling Multi-Hop and Logical Reasoning","created":"2021-10-27","cited_by_count":10,"area":null},{"id":"2401.12231","title":"Disentangled Condensation for Large-scale Graphs","created":"2024-01-18","cited_by_count":10,"area":null},{"id":"2210.00437","title":"A Unified Framework for Optimization-Based Graph Coarsening","created":"2022-10-02","cited_by_count":9,"area":null},{"id":"2405.17003","title":"Graph Condensation for Open-World Graph Learning","created":"2024-05-27","cited_by_count":9,"area":null},{"id":"2405.18127","title":"Graph Coarsening with Message-Passing Guarantees","created":"2024-05-28","cited_by_count":9,"area":null},{"id":"2412.13842","title":"Graph Coarsening via Supervised Granular-Ball for Scalable Graph Neural Network Training","created":"2024-12-18","cited_by_count":9,"area":null},{"id":"2403.14951","title":"Simple Graph Condensation","created":"2024-03-22","cited_by_count":8,"area":null},{"id":"2210.14813","title":"HyperEF: Spectral Hypergraph Coarsening by Effective-Resistance Clustering","created":"2022-10-26","cited_by_count":6,"area":null},{"id":"2308.02916","title":"Adversarial Erasing with Pruned Elements: Towards Better Graph Lottery Ticket","created":"2023-08-05","cited_by_count":5,"area":null},{"id":"2405.17535","title":"Calibrated Dataset Condensation for Faster Hyperparameter Search","created":"2024-05-27","cited_by_count":5,"area":null},{"id":"2108.07901","title":"HyperSF: Spectral Hypergraph Coarsening via Flow-based Local Clustering","created":"2021-08-17","cited_by_count":4,"area":null},{"id":"2402.01261","title":"TEDDY: Trimming Edges with Degree-based Discrimination strategY","created":"2024-02-02","cited_by_count":4,"area":null},{"id":"2405.17404","title":"Spectral Greedy Coresets for Graph Neural Networks","created":"2024-05-27","cited_by_count":3,"area":null},{"id":"2506.11743","title":"Taxonomy of reduction matrices for Graph Coarsening","created":"2025-06-13","cited_by_count":3,"area":null},{"id":"2207.08597","title":"FunQG: Molecular Representation Learning Via Quotient Graphs","created":"2022-07-18","cited_by_count":2,"area":null},{"id":"2505.14033","title":"Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening","created":"2025-05-20","cited_by_count":2,"area":null},{"id":"2506.19224","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","created":"2025-06-24","cited_by_count":2,"area":null},{"id":"2509.22259","title":"Rotary Position Encodings for Graphs","created":"2025-09-26","cited_by_count":2,"area":null},{"id":"2510.02472","title":"Heterogeneous Graph Representation of Stiffened Panels with Non-Uniform Boundary Conditions and Loads","created":"2025-10-02","cited_by_count":2,"area":null},{"id":"2512.01190","title":"LGDC: Latent Graph Diffusion via Spectrum-Preserving Coarsening","created":"2025-12-01","cited_by_count":2,"area":null},{"id":"2201.12670","title":"SMGRL: Scalable Multi-resolution Graph Representation Learning","created":"2022-01-29","cited_by_count":1,"area":null},{"id":"2407.02431","title":"On the Robustness of Graph Reduction Against GNN Backdoor","created":"2024-07-02","cited_by_count":1,"area":null},{"id":"2106.05875","title":"Interferometric Graph Transform for Community Labeling","created":"2021-06-04","cited_by_count":0,"area":null},{"id":"2106.07360","title":"Low-Rank Projections of GCNs Laplacian","created":"2021-06-04","cited_by_count":0,"area":null},{"id":"2306.04828","title":"Fast and Effective GNN Training through Sequences of Random Path Graphs","created":"2023-06-07","cited_by_count":0,"area":null},{"id":"2406.02979","title":"Efficient User Sequence Learning for Online Services via Compressed Graph Neural Networks","created":"2024-06-05","cited_by_count":0,"area":null},{"id":"2407.07128","title":"Modularity aided consistent attributed graph clustering via coarsening","created":"2024-07-09","cited_by_count":0,"area":null},{"id":"2410.10875","title":"SHyPar: A Spectral Coarsening Approach to Hypergraph Partitioning","created":"2024-10-09","cited_by_count":0,"area":null},{"id":"2412.05883","title":"On the Adversarial Robustness of Graph Neural Networks with Graph Reduction","created":"2024-12-08","cited_by_count":0,"area":null},{"id":"2412.13592","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","created":"2024-12-18","cited_by_count":0,"area":null},{"id":"2504.13034","title":"Inference-friendly Graph Compression for Graph Neural Networks","created":"2025-04-17","cited_by_count":0,"area":null},{"id":"2510.00958","title":"Test-Time Search in Neural Graph Coarsening Procedures for the Capacitated Vehicle Routing Problem","created":"2025-10-01","cited_by_count":0,"area":null},{"id":"2511.02196","title":"BoolSkeleton: Boolean Network Skeletonization via Homogeneous Pattern Reduction","created":"2025-11-04","cited_by_count":0,"area":null},{"id":"2512.24327","title":"Topological Spatial Graph Coarsening","created":"2025-12-30","cited_by_count":0,"area":null},{"id":"2601.22943","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","created":"2026-01-30","cited_by_count":0,"area":null},{"id":"2607.21885","title":"Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement","created":"2026-07-24","cited_by_count":0,"area":null},{"id":"2607.22287","title":"Efficient Recommendations via Graph Coarsening and Label Propagation","created":"2026-07-24","cited_by_count":0,"area":null},{"id":"2607.23338","title":"Does Graph Compression Preserve Signal Propagation?","created":"2026-07-25","cited_by_count":0,"area":null},{"id":"2609.25149","title":"Dual-GNN Multilevel Coarsening for Maximum Independent Set","created":"2026-09-21","cited_by_count":0,"area":null}],"next_cursor":null}