Alternatives and similar repositories for cgSpan

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

• gaoji7777 / walign
  Wasserstein Distance Graph Alignment
  ☆23Updated 4 years ago
• BorgwardtLab / significant-subgraph-mining
  Finding statistically significant subgraphs while correcting for multiple testing
  ☆8Updated 9 years ago
• BorgwardtLab / filtration_curves
  Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'
  ☆18Updated last year
• Graph-COM / SUREL_Plus
  [VLDB'23] SUREL+ is a novel set-based computation framework for scalable subgraph-based graph representation learning.
  ☆17Updated 3 months ago
• ChristalC / Frequent-Subgraph-Mining
  Frequent subgraph mining using FFSM algorithm, C++
  ☆11Updated 7 years ago
• LPioL / MultiVERSE
  ☆20Updated 4 years ago
• MichailChatzianastasis / GOAT
  Official Code Repository for the paper "Graph Ordering Attention Networks"
  ☆21Updated last year
• egalimberti / multilayer_core_decomposition
  Core Decomposition in Multilayer Networks: Theory, Algorithms, and Applications
  ☆12Updated 6 years ago
• TRI-GNN / TRI-GNN
  ☆12Updated 3 years ago
• simondelarue / dynGNN
  Representation and learning framework for dynamic graphs using Graph Neural Networks.
  ☆12Updated 3 years ago
• radoslav11 / SP-MPNN
  Implementation of the SPN model and the experiments from the LoG 2022 paper "Shortest Path Networks for Graph Property Prediction".
  ☆25Updated 2 years ago
• abhilash1910 / SpectralEmbeddings
  spectralembeddings is a python library which is used to generate node embeddings from Knowledge graphs using GCN kernels and Graph Autoe…
  ☆64Updated 3 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 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
• AnoushkaVyas / GraphZoo
  Facilitating learning, using, and designing graph processing pipelines/models systematically.
  ☆26Updated 2 years ago
• toenshoff / CRaWl
  ☆24Updated last year
• CharlotteMagister / GCExplainer
  ☆19Updated last year
• a-lucic / cf-gnnexplainer
  ☆60Updated 3 years ago
• divelab / LGLP
  ☆20Updated 4 years ago
• moranbel / tdGraphEmbed
  ☆21Updated last year
• benedekrozemberczki / FEATHER
  The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…
  ☆51Updated 2 years ago
• ColinConduff / FrequentSubgraphMining
  This is a python implementation of the Gaston frequent subgraph mining algorithm.
  ☆21Updated 5 years ago
• KyuhanLee / SSumM
  SSumM: Sparse Summarization of Massive Graphs
  ☆19Updated 5 years ago
• pbielak / graph-barlow-twins
  The official implementation of the Graph Barlow Twins method with the experimental pipeline
  ☆31Updated last year
• karl-zhao / benchmarking-gnns-pyg
  ☆31Updated 2 years ago
• GraphFramEx / graphframex
  GraphFramEx: a systematic evaluation framework for explainability methods on GNNs
  ☆44Updated last year
• RPaolino / loopy
  ☆11Updated 11 months ago
• G-Taxonomy-Workgroup / GTaxoGym
  Taxonomy of Benchmarks in Graph Representation Learning
  ☆19Updated 2 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆83Updated 10 months 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