Alternatives and similar repositories for fastPFP:

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

• galanisl / NetHypGeom
  Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.
  ☆26Updated 6 years ago
• ChristalC / Frequent-Subgraph-Mining
  Frequent subgraph mining using FFSM algorithm, C++
  ☆11Updated 7 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
• priba / siamese_ged
  Learning Graph Distances with Message PassingNeural Networks
  ☆13Updated 6 months ago
• bgauzere / graph-lib
  C++ library for graph kernel and edit distance algorithm
  ☆15Updated 6 years ago
• LPioL / MultiVERSE
  ☆19Updated 4 years ago
• usc-cloud / parallel-high-betweenness-centrality
  MPI based algorithm for detecting high centrality vertices in large graphs
  ☆8Updated 10 years ago
• Murali-group / halp
  Hypergraph Algorithms Package
  ☆94Updated last year
• jacquesfize / GMatch4py
  A graph matching library for Python
  ☆199Updated 9 months ago
• priba / aproximated_ged
  Bunch of aproximated graph edit distance algorithms.
  ☆33Updated 6 years ago
• linhongseba / MaximumClique
  The implementation for maximum clique enumeration algorithm
  ☆11Updated 8 years ago
• usc-cloud / goffish
  USC GoFFish Graph Analytics Framework
  ☆33Updated 10 years ago
• snap-stanford / snap-dev
  SNAP repository for Ringo
  ☆14Updated 7 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 4 years ago
• RoyalCaliber / vertexAPI2
  A vertex-centric CUDA/C++ API for large graph analytics on GPUs using the Gather-Apply-Scatter abstraction
  ☆23Updated 10 years ago
• ehab-abdelhamid / ScaleMine
  Parallel Frequent Subgraph Mining
  ☆30Updated 7 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 4 years ago
• cnmusco / graph-similarity-learning
  Algorithms for learning network structure from effective resistances and other random-walk-based similarities.
  ☆30Updated 7 years ago
• iromu / Graclus
  Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…
  ☆22Updated 12 years ago
• mims-harvard / fastGNMF
  Fast graph-regularized matrix factorization
  ☆20Updated last year
• benedekrozemberczki / FSCNMF
  An implementation of "Fusing Structure and Content via Non-negative Matrix Factorization for Embedding Information Networks".
  ☆20Updated 2 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 5 years ago
• stvdedal / gspan
  graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation
  ☆11Updated 7 years ago
• TuftsBCB / Walker
  Python implementation of Kohler et al.'s random walk with restart
  ☆29Updated 6 years ago
• robmccoll / stinger
  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
• BorgwardtLab / significant-subgraph-mining
  Finding statistically significant subgraphs while correcting for multiple testing
  ☆8Updated 9 years ago
• jacquesfize / ged4py
  Implementation of a graph edit distance in python
  ☆33Updated 5 years ago
• kbase / narrative
  ☆17Updated 2 weeks ago
• Caselles / graph_kernels
  Four of the main kernels on graphs Python implementation.
  ☆16Updated 8 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago