Learning to Predict Graphs with Fused Gromov-Wasserstein Barycenters

8 February 2022

Papers citing "Learning to Predict Graphs with Fused Gromov-Wasserstein Barycenters"

6 / 6 papers shown

Title
A Fused Gromov-Wasserstein Approach to Subgraph Contrastive Learning Amadou S. Sangare Nicolas Dunou Jhony H. Giraldo Fragkiskos D. Malliaros SSL 62 0 0 28 Feb 2025
Exploiting Edge Features in Graphs with Fused Network Gromov-Wasserstein Distance Junjie Yang Matthieu Labeau Steeven Villa OT 24 1 0 28 Sep 2023
Implicit Graphon Neural Representation Xinyue Xia Gal Mishne Yusu Wang GNN AI4CE 32 4 0 07 Nov 2022
Efficient Approximation of Gromov-Wasserstein Distance Using Importance Sparsification Mengyu Li Jun Yu Hongteng Xu Cheng Meng 26 13 0 26 May 2022
Online Graph Dictionary Learning Cédric Vincent-Cuaz Titouan Vayer Rémi Flamary Marco Corneli Nicolas Courty 26 44 0 12 Feb 2021
Graph Convolutional Policy Network for Goal-Directed Molecular Graph Generation Jiaxuan You Bowen Liu Rex Ying Vijay S. Pande J. Leskovec GNN 189 885 0 07 Jun 2018