haakondr / graph-edit-distance-python
☆49Updated 8 years ago
Alternatives and similar repositories for graph-edit-distance-python:
Users that are interested in graph-edit-distance-python are comparing it to the libraries listed below
- Implementation of a graph edit distance in python☆33Updated 5 years ago
- A package for computing Graph Kernels☆104Updated last year
- C++ library for graph kernel and edit distance algorithm☆15Updated 6 years ago
- Graph kernels☆56Updated 3 years ago
- ☆172Updated 6 years ago
- A graph matching library for Python☆200Updated 11 months ago
- An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.☆59Updated last year
- ☆13Updated 6 years ago
- Bunch of aproximated graph edit distance algorithms.☆33Updated 6 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆82Updated 6 years ago
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆95Updated 3 years ago
- TensorFlow implementation of Deep Graph Infomax☆62Updated 6 years ago
- Implementation of the paper "Community Detection with Graph Neural Networks", by J. Bruna and L. Li☆73Updated 7 years ago
- A python package for graph kernels, graph edit distances, and graph pre-image problem.☆124Updated last year
- Contains the code (and working vm setup) for our KDD MLG 2016 paper titled: "subgraph2vec: Learning Distributed Representations of Rooted…☆42Updated 7 years ago
- Sample Code for Graph Partition Neural Networks☆94Updated 6 years ago
- A convolutional neural network for graph classification in PyTorch☆91Updated 6 years ago
- Implementation of ComE algorithm☆59Updated 2 years ago
- PyTorch implementation for Graph Gated Neural Network (for Knowledge Graphs)☆47Updated 2 years ago
- embedding attributed graphs☆58Updated 3 years ago
- Learning to query complex networks☆116Updated 9 months ago
- Implementation of the paper "Community Detection with Graph Neural Networks", [1] in Pytorch☆36Updated 7 years ago
- ☆148Updated 5 years ago
- ☆24Updated 4 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 3 years ago
- Four of the main kernels on graphs Python implementation.☆16Updated 8 years ago
- Code for the AAAI 2018 Paper "HARP: Hierarchical Representation Learning for Networks"☆116Updated last year
- Graph similarity algorithms based on NetworkX.☆169Updated 5 years ago
- Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"☆42Updated last year
- gBolt--very fast implementation for gSpan algorithm in data mining☆56Updated 3 years ago