{"total":31,"rows":[{"id":"2110.05292","title":"Understanding Pooling in Graph Neural Networks","created":"2021-10-11","cited_by_count":69,"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":"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":"2106.11863","title":"Graph coarsening: From scientific computing to machine learning","created":"2021-06-22","cited_by_count":21,"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":"2206.00118","title":"Principle of Relevant Information for Graph Sparsification","created":"2022-05-31","cited_by_count":9,"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":"2402.02000","title":"A Survey on Graph Condensation","created":"2024-02-03","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":"2301.08970","title":"The Conditional Cauchy-Schwarz Divergence with Applications to Time-Series Data and Sequential Decision Making","created":"2023-01-21","cited_by_count":6,"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":"2506.11743","title":"Taxonomy of reduction matrices for Graph Coarsening","created":"2025-06-13","cited_by_count":3,"area":null},{"id":"2201.05923","title":"Theoretical analysis and computation of the sample Frechet mean for sets of large graphs based on spectral information","created":"2022-01-15","cited_by_count":2,"area":null},{"id":"2207.08597","title":"FunQG: Molecular Representation Learning Via Quotient Graphs","created":"2022-07-18","cited_by_count":2,"area":null},{"id":"2506.06558","title":"Rapid training of Hamiltonian graph networks using random features","created":"2025-06-06","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":"2309.03523","title":"DGC: Training Dynamic Graphs with Spatio-Temporal Non-Uniformity using Graph Partitioning by Chunks","created":"2023-09-07","cited_by_count":1,"area":null},{"id":"2505.15842","title":"AH-UGC: Adaptive and Heterogeneous-Universal Graph Coarsening","created":"2025-05-18","cited_by_count":1,"area":null},{"id":"2605.17154","title":"Learning Gaussian Graphical Models under Total Positivity via Spectral Graph Sparsification","created":"2026-05-16","cited_by_count":1,"area":null},{"id":"2101.09174","title":"Sparsistent filtering of comovement networks from high-dimensional data","created":"2021-01-22","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":"2601.22943","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","created":"2026-01-30","cited_by_count":0,"area":null},{"id":"2605.16809","title":"Informative Graph Structure Learning","created":"2026-05-16","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":"2608.11016","title":"Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms","created":"2026-08-11","cited_by_count":0,"area":null}],"next_cursor":null}