priba / aproximated_ged

Related projects ⓘ

Alternatives and complementary repositories for aproximated_ged

• guillaumejaume / edGNN
  Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"
  ☆43Updated last year
• jacquesfize / ged4py
  Implementation of a graph edit distance in python
  ☆34Updated 5 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 4 years ago
• bgauzere / graph-lib
  C++ library for graph kernel and edit distance algorithm
  ☆16Updated 6 years ago
• KelestZ / CondGen
  Conditional Structure Generation through Graph Variational Generative Adversarial Nets, NeurIPS 2019.
  ☆54Updated 5 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 5 years ago
• balcilar / Spectral-Designed-Graph-Convolutions
  Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper
  ☆49Updated 3 years ago
• chentingpc / gfn
  Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"
  ☆51Updated 4 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 4 years ago
• shionhonda / gae-dgl
  Reimplementation of Graph Autoencoder by Kipf & Welling with DGL.
  ☆65Updated last year
• jajupmochi / graphkit-learn
  A python package for graph kernels, graph edit distances, and graph pre-image problem.
  ☆123Updated 8 months ago
• nimadehmamy / Understanding-GCN
  code for the paper in NeurIPS 2019
  ☆40Updated last year
• AaltoPML / Rethinking-pooling-in-GNNs
  ☆62Updated 4 years ago
• dbblumenthal / gedlib
  An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
  ☆57Updated last year
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆21Updated 4 years ago
• Nate1874 / StructPool
  The code for our ICLR paper: StructPool: Structured Graph Pooling via Conditional Random Fields
  ☆57Updated 4 years ago
• malllabiisc / ConfGCN
  AISTATS 2019: Confidence-based Graph Convolutional Networks for Semi-Supervised Learning
  ☆58Updated 5 years ago
• deezer / fastgae
  Source code from the article "FastGAE: Scalable Graph Autoencoders with Stochastic Subgraph Decoding" by G. Salha, R. Hennequin, J.B. Rem…
  ☆26Updated 2 years ago
• Chen-Cai-OSU / LDP
  LDP for graph classification
  ☆23Updated 5 years ago
• plai-group / gae_in_pytorch
  Graph Auto-Encoder in PyTorch
  ☆81Updated last year
• rusty1s / himp-gnn
  Hierarchical Inter-Message Passing for Learning on Molecular Graphs
  ☆77Updated 2 years ago
• LijunChang / Graph_Edit_Distance
  Exact graph edit distance (GED) computation and verification
  ☆54Updated 2 years ago
• idea-iitd / greed
  official repo for the NeurIPS 2022 paper "GREED: A Neural Framework for Learning Graph Distance Functions"
  ☆27Updated last year
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆78Updated 2 months ago
• nd7141 / graph_datasets
  Data for "Understanding Isomorphism Bias in Graph Data Sets" paper.
  ☆88Updated 4 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆81Updated 6 years ago
• karl-zhao / benchmarking-gnns-pyg
  ☆30Updated last year
• priba / siamese_ged
  Learning Graph Distances with Message PassingNeural Networks
  ☆13Updated 3 months ago
• tech-srl / bottleneck
  Code for the paper: "On the Bottleneck of Graph Neural Networks and Its Practical Implications"
  ☆93Updated 2 years ago