Alternatives and similar repositories for gSparse

Users that are interested in gSparse are comparing it to the libraries listed below

• TheGravLab / A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening
  Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)
  ☆16Updated 4 years ago
• loukasa / graph-coarsening
  Multilevel graph coarsening algorithm with spectral and cut guarantees
  ☆89Updated 5 years ago
• Graph-COM / SUREL_Plus
  [VLDB'23] SUREL+ is a novel set-based computation framework for scalable subgraph-based graph representation learning.
  ☆17Updated last month
• samirchowdhury / HyperCOT
  Code for computing Hypergraph Co-Optimal Transport distances
  ☆16Updated 2 years ago
• yuhanchan / sparsification
  ☆14Updated last year
• fedelopez77 / sympa
  Embedding graphs in symmetric spaces
  ☆30Updated 3 years ago
• luis-mueller / probing-graph-transformers
  Code for our paper "Attending to Graph Transformers"
  ☆87Updated last year
• PythonOT / COOT
  CO-Optimal Transport
  ☆42Updated 4 years ago
• chrsmrrs / SpeqNets
  ☆12Updated 2 years ago
• gasteigerjo / gtn
  Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…
  ☆15Updated 2 years ago
• floklimm / hypergraph
  Library of python functions for the analysis of hypergraphs.
  ☆12Updated 4 months ago
• gasteigerjo / lcn
  Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …
  ☆19Updated 2 years ago
• toenshoff / CRaWl
  ☆24Updated last year
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆78Updated 6 years ago
• delta2323 / gnn-asymptotics
  Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.
  ☆30Updated 5 years ago
• twistedcubic / copt
  [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
  ☆16Updated 4 years ago
• HekpoMaH / algorithmic-concepts-reasoning
  ☆25Updated 3 years ago
• BorgwardtLab / TOGL
  Topological Graph Neural Networks (ICLR 2022)
  ☆124Updated 2 years ago
• lrnzgiusti / on-oversquashing
  Official repository for On Over-Squashing in Message Passing Neural Networks (ICML 2023)
  ☆15Updated last year
• balcilar / Spectral-Designed-Graph-Convolutions
  Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper
  ☆50Updated 4 years ago
• bwilder0 / clusternet
  Code release for NeurIPS 2019 paper "End to End Learning and Optimization on Graphs"
  ☆91Updated 5 years ago
• haguettaz / ChebLieNet
  ChebLieNet, a spectral graph neural network turned equivariant by Riemannian geometry on Lie groups.
  ☆16Updated 9 months ago
• KiddoZhu / NBFNet-PyG
  PyG re-implementation of Neural Bellman-Ford Networks (NeurIPS 2021)
  ☆68Updated 2 years ago
• kfoynt / LocalGraphClustering
  ☆141Updated 4 years ago
• noamrazin / gnn_interactions
  Code for reproducing experiments in "On the Ability of Graph Neural Networks to Model Interactions Between Vertices"
  ☆25Updated last year
• gaoji7777 / walign
  Wasserstein Distance Graph Alignment
  ☆23Updated 4 years ago
• Hermina / fGOT
  Code accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"
  ☆15Updated 2 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆41Updated last year
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆81Updated 9 months ago