Alternatives and similar repositories for LDP

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

• chrsmrrs / sparsewl
  Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"
  ☆22Updated 3 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆82Updated 7 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆86Updated last year
• chentingpc / gfn
  Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"
  ☆53Updated 5 years ago
• chrsmrrs / k-gnn
  Source code for our AAAI paper "Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks".
  ☆190Updated 3 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆105Updated 5 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆63Updated 4 years ago
• karl-zhao / benchmarking-gnns-pyg
  ☆31Updated 2 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 6 years ago
• plai-group / gae_in_pytorch
  Graph Auto-Encoder in PyTorch
  ☆81Updated 2 years ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 6 years ago
• leowyy / GraphTSNE
  PyTorch Implementation of GraphTSNE, ICLR’19
  ☆137Updated 6 years ago
• tech-srl / bottleneck
  Code for the paper: "On the Bottleneck of Graph Neural Networks and Its Practical Implications"
  ☆97Updated 3 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 5 years ago
• nimadehmamy / Understanding-GCN
  code for the paper in NeurIPS 2019
  ☆40Updated 2 years ago
• cvignac / SMP
  ☆29Updated 4 years ago
• lucfra / LDS-GNN
  Learning Discrete Structures for Graph Neural Networks (TensorFlow implementation)
  ☆199Updated last year
• danielzuegner / netgan
  Implementation of the paper "NetGAN: Generating Graphs via Random Walks".
  ☆196Updated 4 years ago
• abojchevski / graph2gauss
  Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".
  ☆177Updated 2 years ago
• zhengdao-chen / GNN4CD
  Supervised community detection with line graph neural networks
  ☆90Updated 5 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• nikhil-dce / SBM-meet-GNN
  Implementation of SBM-meet-GNN
  ☆23Updated 6 years ago
• topology474 / WKPI
  WKPI: A kernel based on persistent homology
  ☆12Updated 5 years ago
• guillaumejaume / edGNN
  Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"
  ☆43Updated 2 years ago
• LingxiaoShawn / PairNorm
  Source code for PairNorm (ICLR 2020)
  ☆79Updated 5 years ago
• samihaija / mixhop
  Official Implementation of ICML 2019 Paper. MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing; an…
  ☆125Updated 6 years ago
• nd7141 / graph_datasets
  Data for "Understanding Isomorphism Bias in Graph Data Sets" paper.
  ☆90Updated 5 years ago
• gbouritsas / GSN
  Official repository for the paper "Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting" (TPAMI'22) https://arxi…
  ☆103Updated 4 years ago
• snap-stanford / distance-encoding
  Distance Encoding for GNN Design
  ☆187Updated 4 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆22Updated 5 years ago