Alternatives and similar repositories for fastPFP:

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

• priba / siamese_ged
  Learning Graph Distances with Message PassingNeural Networks
  ☆13Updated 9 months ago
• ColinConduff / FrequentSubgraphMining
  This is a python implementation of the Gaston frequent subgraph mining algorithm.
  ☆20Updated 5 years ago
• galanisl / NetHypGeom
  Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.
  ☆26Updated 6 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 5 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 6 years ago
• ehab-abdelhamid / ScaleMine
  Parallel Frequent Subgraph Mining
  ☆31Updated 7 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• benedekrozemberczki / FSCNMF
  An implementation of "Fusing Structure and Content via Non-negative Matrix Factorization for Embedding Information Networks".
  ☆20Updated 2 years ago
• jacquesfize / GMatch4py
  A graph matching library for Python
  ☆203Updated last year
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated last year
• benedekrozemberczki / OrbitalFeatures
  A sparsity aware implementation of "Biological Network Comparison Using Graphlet Degree Distribution" (Bioinformatics 2007)
  ☆26Updated 2 years ago
• benedekrozemberczki / GraRep
  A SciPy implementation of "GraRep: Learning Graph Representations with Global Structural Information" (WWW 2015).
  ☆65Updated 2 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆61Updated 3 years ago
• ilonajulczuk / hypergraph
  Simulation of diffusion on hypergraphs
  ☆33Updated 10 years ago
• muhanzhang / LinkPrediction
  Code for "M. Zhang, Y. Chen, Weisfeiler-Lehman Neural Machine for Link Prediction, KDD 2017 oral"
  ☆55Updated 6 years ago
• benedekrozemberczki / Societe-General
  Solution for ENS - Societe Generale Challenge (1st place).
  ☆6Updated 3 years ago
• LPioL / MultiVERSE
  ☆20Updated 4 years ago
• priba / aproximated_ged
  Bunch of aproximated graph edit distance algorithms.
  ☆34Updated 6 years ago
• cnmusco / graph-similarity-learning
  Algorithms for learning network structure from effective resistances and other random-walk-based similarities.
  ☆30Updated 7 years ago
• kijungs / corescope
  CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)
  ☆16Updated 5 months ago
• NaazS03 / cgSpan
  Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.
  ☆10Updated 3 years ago
• Murali-group / halp
  Hypergraph Algorithms Package
  ☆96Updated last year
• jajupmochi / py-graph
  ☆8Updated 5 years ago
• rusty1s / embedded_gcnn
  Embedded Graph Convolutional Neural Networks (EGCNN) in TensorFlow
  ☆78Updated 6 years ago
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆54Updated 7 years ago
• bgauzere / graph-lib
  C++ library for graph kernel and edit distance algorithm
  ☆15Updated 6 years ago
• LJeub / LocalCommunities
  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
• ChristalC / Frequent-Subgraph-Mining
  Frequent subgraph mining using FFSM algorithm, C++
  ☆11Updated 7 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago