emanuele / fastPFP
Implementation of the fastPFP approximate subgraph matching algorithm, as described in http://arxiv.org/abs/1207.1114
☆11Updated 9 years ago
Alternatives and similar repositories for fastPFP:
Users that are interested in fastPFP are comparing it to the libraries listed below
- Frequent subgraph mining using FFSM algorithm, C++☆10Updated 7 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 4 years ago
- Learning Graph Distances with Message PassingNeural Networks☆13Updated 5 months ago
- Graph kernels☆56Updated 3 years ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 6 years ago
- Algorithms for learning network structure from effective resistances and other random-walk-based similarities.☆31Updated 6 years ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Updated 10 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 4 years ago
- The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…☆11Updated 9 years ago
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆19Updated 4 years ago
- Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.☆26Updated 6 years ago
- Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.☆10Updated 3 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆10Updated 7 years ago
- A package for computing Graph Kernels☆103Updated last year
- Implementation of the Multiscale Laplacian Graph Kernel☆18Updated 5 years ago
- Finding statistically significant subgraphs while correcting for multiple testing☆7Updated 9 years ago
- An implementation of "Fusing Structure and Content via Non-negative Matrix Factorization for Embedding Information Networks".☆20Updated 2 years ago
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- Fast consensus clustering in networks☆22Updated 4 months ago
- Label Propagation based Community Detection algorithm implemented using multiprocessing module in python (Please have a look at my othe…☆9Updated 14 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- Python wrapper for the Kavosh network motif finder☆51Updated 10 years ago
- Code for paper: Localized matrix factorization for recommendation based on matrix block diagonal forms☆10Updated 9 years ago
- Four of the main kernels on graphs Python implementation.☆16Updated 7 years ago
- Library of graph algorithms for Apache Giraph.☆8Updated 9 years ago
- A vertex-centric CUDA/C++ API for large graph analytics on GPUs using the Gather-Apply-Scatter abstraction☆23Updated 10 years ago
- ☆11Updated 7 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 5 years ago
- Bunch of aproximated graph edit distance algorithms.☆33Updated 6 years ago
- A framework for evaluating community mining algorithms.☆10Updated 8 years ago