dzambon / graph-matching-toolkit
☆24Updated 4 years ago
Alternatives and similar repositories for graph-matching-toolkit:
Users that are interested in graph-matching-toolkit are comparing it to the libraries listed below
- ☆17Updated 4 years ago
- ☆13Updated 6 years ago
- Code for the paper "Unsupervised Community Detection with Modularity-based Attention Model"☆36Updated 4 years ago
- Graph Recurrent Networks with Attributed Random Walks☆28Updated last year
- Source code for our IEEE ICDM 2017 paper "Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs".☆11Updated 7 years ago
- An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.☆59Updated last year
- ☆27Updated 4 months ago
- Deeper insights into graph convolutional networks for semi-supervised learning☆19Updated 6 years ago
- Implementation of a graph edit distance in python☆33Updated 5 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 12 years ago
- Implementation of Meta-GNN in TensorFlow☆47Updated 3 years ago
- ☆16Updated 4 years ago
- Bunch of aproximated graph edit distance algorithms.☆33Updated 6 years ago
- Stochastic training of graph convolutional networks☆85Updated 2 years ago
- Scalable Graph Neural Networks for Heterogeneous Graphs☆72Updated 4 years ago
- Deep Graph Kernels☆13Updated 9 years ago
- LEAP (Learning Edges by Aggregation of Paths)☆12Updated last year
- Implementation of our CVPR 2021 paper "Combinatorial Learning of Graph Edit Distance via Dynamic Embedding".☆28Updated 2 years ago
- ☆12Updated 6 years ago
- This repository summarises the open source codes of our group☆27Updated 2 years ago
- C++ library for graph kernel and edit distance algorithm☆15Updated 6 years ago
- ☆14Updated last year
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- The code for our ICLR paper: StructPool: Structured Graph Pooling via Conditional Random Fields☆58Updated 4 years ago
- ☆52Updated 5 years ago
- ☆47Updated 5 years ago
- Laplacian Change Point Detection for Dynamic Graphs (KDD 2020)☆26Updated last year
- Source Code for AAAI 2022 paper "Graph Convolutional Networks with Dual Message Passing for Subgraph Isomorphism Counting and Matching"☆23Updated 2 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆53Updated 7 months ago
- Implement of DiGCN, NeurIPS-2020☆47Updated 3 years ago