{"total":38,"rows":[{"id":"2102.06555","title":"Online Graph Dictionary Learning","created":"2021-02-12","cited_by_count":37,"area":null},{"id":"2110.02753","title":"Semi-relaxed Gromov-Wasserstein divergence with applications on graphs","created":"2021-10-06","cited_by_count":21,"area":null},{"id":"2205.15733","title":"Template based Graph Neural Network with Optimal Transport Distances","created":"2022-05-31","cited_by_count":20,"area":null},{"id":"2104.02013","title":"Quantized Gromov-Wasserstein","created":"2021-04-05","cited_by_count":19,"area":null},{"id":"2106.05194","title":"DIGRAC: Digraph Clustering Based on Flow Imbalance","created":"2021-06-09","cited_by_count":15,"area":null},{"id":"2301.12721","title":"Robust Attributed Graph Alignment via Joint Structure Learning and Optimal Transport","created":"2023-01-30","cited_by_count":15,"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":"2306.15963","title":"Fused Gromov-Wasserstein Graph Mixup for Graph-level Classifications","created":"2023-06-28","cited_by_count":15,"area":null},{"id":"2402.02239","title":"Distributional Reduction: Unifying Dimensionality Reduction and Clustering with Gromov-Wasserstein","created":"2024-02-03","cited_by_count":12,"area":null},{"id":"2408.08233","title":"The Z-Gromov-Wasserstein Distance","created":"2024-08-15","cited_by_count":12,"area":null},{"id":"2205.13573","title":"Efficient Approximation of Gromov-Wasserstein Distance Using Importance Sparsification","created":"2022-05-26","cited_by_count":11,"area":null},{"id":"2303.06595","title":"A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data","created":"2023-03-12","cited_by_count":11,"area":null},{"id":"2206.02386","title":"Restructuring Graph for Higher Homophily via Adaptive Spectral Clustering","created":"2022-06-06","cited_by_count":9,"area":null},{"id":"2302.04610","title":"Outlier-Robust Gromov-Wasserstein for Graph Data","created":"2023-02-09","cited_by_count":6,"area":null},{"id":"2303.05978","title":"Uncovering Challenges of Solving the Continuous Gromov-Wasserstein Problem","created":"2023-03-10","cited_by_count":6,"area":null},{"id":"2201.12064","title":"Multiscale Graph Comparison via the Embedded Laplacian Discrepancy","created":"2022-01-28","cited_by_count":5,"area":null},{"id":"2110.10932","title":"Subspace Detours Meet Gromov-Wasserstein","created":"2021-10-21","cited_by_count":4,"area":null},{"id":"2402.01975","title":"Structure-Aware E(3)-Invariant Molecular Conformer Aggregation Networks","created":"2024-02-03","cited_by_count":4,"area":null},{"id":"2206.09127","title":"Nonparametric Multi-shape Modeling with Uncertainty Quantification","created":"2022-06-18","cited_by_count":2,"area":null},{"id":"2404.08970","title":"Fast Gradient Computation for Gromov-Wasserstein Distance","created":"2024-04-13","cited_by_count":2,"area":null},{"id":"2411.02198","title":"Metric properties of partial and robust Gromov-Wasserstein distances","created":"2024-11-04","cited_by_count":2,"area":null},{"id":"2501.17443","title":"Gradual Domain Adaptation for Graph Learning","created":"2025-01-29","cited_by_count":2,"area":null},{"id":"2205.08115","title":"Fast and Provably Convergent Algorithms for Gromov-Wasserstein in Graph Data","created":"2022-05-17","cited_by_count":1,"area":null},{"id":"2305.01379","title":"LogSpecT: Feasible Graph Learning Model from Stationary Signals with Recovery Guarantees","created":"2023-05-02","cited_by_count":1,"area":null},{"id":"2402.04732","title":"Graph Cuts with Arbitrary Size Constraints Through Optimal Transport","created":"2024-02-07","cited_by_count":1,"area":null},{"id":"2410.16669","title":"Linear Partial Gromov-Wasserstein Embedding","created":"2024-10-22","cited_by_count":1,"area":null},{"id":"2509.18826","title":"Graph-based Clustering Revisited: A Relaxation of Kernel $k$-Means Perspective","created":"2025-09-23","cited_by_count":1,"area":null},{"id":"2509.22549","title":"Metrics for Parametric Families of Networks","created":"2025-09-26","cited_by_count":1,"area":null},{"id":"2106.07501","title":"Balanced Coarsening for Multilevel Hypergraph Partitioning via Wasserstein Discrepancy","created":"2021-06-14","cited_by_count":0,"area":null},{"id":"2310.03398","title":"Interpolating between Clustering and Dimensionality Reduction with Gromov-Wasserstein","created":"2023-10-05","cited_by_count":0,"area":null},{"id":"2310.19960","title":"Topological Learning for Motion Data via Mixed Coordinates","created":"2023-10-30","cited_by_count":0,"area":null},{"id":"2408.06525","title":"Note on computational complexity of the Gromov-Wasserstein distance","created":"2024-08-12","cited_by_count":0,"area":null},{"id":"2411.10204","title":"Fused Gromov-Wasserstein Variance Decomposition with Linear Optimal Transport","created":"2024-11-15","cited_by_count":0,"area":null},{"id":"2503.23002","title":"Learning Structure-enhanced Temporal Point Processes with Gromov-Wasserstein Regularization","created":"2025-03-29","cited_by_count":0,"area":null},{"id":"2511.16868","title":"The Joint Gromov Wasserstein Objective for Multiple Object Matching","created":"2025-11-21","cited_by_count":0,"area":null},{"id":"2605.28488","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","created":"2026-05-27","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},{"id":"2610.04264","title":"Adaptive Bregman Alternating Projections for Feasible Gromov-Wasserstein Learning","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}