Alternatives and similar repositories for py-graph

Users that are interested in py-graph are comparing it to the libraries listed below

• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆22Updated 5 years ago
• DavidMcDonald1993 / heat
  Reference implementation of the HEAT algorithm described in https://link.springer.com/chapter/10.1007/978-3-030-62362-3_4
  ☆11Updated 2 years ago
• delta2323 / gnn-asymptotics
  Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.
  ☆30Updated 5 years ago
• matenure / OTCoarsening
  Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
  ☆36Updated 4 years ago
• leichen2018 / GNN-Substructure-Counting
  The official implementation of ''Can Graph Neural Networks Count Substructures?'' NeurIPS 2020
  ☆34Updated 4 years ago
• InkToYou / WL-Kernel-DGL
  An Implementation of 1-Weisfeiler-Lehman Algorithm using Deep Graph Library
  ☆9Updated 4 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 5 years ago
• 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
• muhanzhang / NestedGNN
  ☆57Updated 3 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 4 years ago
• flyingtango / DiGCL
  The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021
  ☆35Updated 3 years ago
• GemsLab / RGM
  Fast embedding-based graph classification with connections to kernels
  ☆12Updated 5 years ago
• DEEP-PolyU / GraphRNA_KDD19
  Graph Recurrent Networks with Attributed Random Walks
  ☆28Updated last year
• Graph-COM / SUREL
  [VLDB'22] SUREL is a novel walk-based computation framework for efficient subgraph-based graph representation learning.
  ☆19Updated last month
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• yifan-h / CS-GNN
  Measuring and Improving the Use of Graph Information in Graph Neural Networks
  ☆82Updated 10 months ago
• CheriseZhu / GIL
  The implementation of our NeurIPS 2020 paper "Graph Geometry Interaction Learning" (GIL)
  ☆46Updated 4 years ago
• ebonilla / VGCN
  Variational Graph Convolutional Networks
  ☆23Updated 4 years ago
• nimadehmamy / Understanding-GCN
  code for the paper in NeurIPS 2019
  ☆40Updated 2 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆61Updated 3 years ago
• chrsmrrs / sparsewl
  Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"
  ☆22Updated 3 years ago
• twitter-research / sign
  SIGN: Scalable Inception Graph Network
  ☆97Updated 4 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆81Updated 9 months ago
• giannisnik / message_passing_graph_kernels
  ☆16Updated 5 years ago
• CheriseZhu / GSSNN
  The implementation of our AAAI 2020 paper "GSSNN: Graph Smoothing Splines Neural Network".
  ☆20Updated 4 years ago
• cvignac / SMP
  ☆28Updated 3 years ago
• uta-smile / HGCN
  ☆12Updated 4 years ago
• GentleZhu / Shift-Robust-GNNs
  "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')
  ☆48Updated 3 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆83Updated 6 years ago
• amoliu / CayleyNet
  Graph Convolutional Neural Networks with Complex Rational Spectral Filters
  ☆26Updated 6 years ago