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 8 months ago
• galanisl / NetHypGeom
  Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.
  ☆26Updated 6 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
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated last year
• ColinConduff / FrequentSubgraphMining
  This is a python implementation of the Gaston frequent subgraph mining algorithm.
  ☆20Updated 5 years ago
• LPioL / MultiVERSE
  ☆19Updated 4 years ago
• isaranto / omega_index
  Omega Index for evaluation of overlapping community structure - (Python package available through pip)
  ☆12Updated 3 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆12Updated 4 years ago
• Murali-group / halp
  Hypergraph Algorithms Package
  ☆95Updated last year
• NaazS03 / cgSpan
  Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.
  ☆10Updated 3 years ago
• jacquesfize / GMatch4py
  A graph matching library for Python
  ☆202Updated 11 months ago
• JSybrandt / HypergraphEmbedding
  ☆11Updated 5 years ago
• ChristalC / Frequent-Subgraph-Mining
  Frequent subgraph mining using FFSM algorithm, C++
  ☆11Updated 7 years ago
• Data2Semantics / mustard
  mustard - Machine learning Using Svms To Analyse Rdf Data
  ☆43Updated 7 years ago
• thocevar / orca
  ORbit Counting Algorithm
  ☆37Updated 8 years ago
• ehab-abdelhamid / ScaleMine
  Parallel Frequent Subgraph Mining
  ☆30Updated 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
• gtremper / Network-Motif
  Python wrapper for the Kavosh network motif finder
  ☆51Updated 10 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆81Updated 7 months ago
• usc-cloud / parallel-high-betweenness-centrality
  MPI based algorithm for detecting high centrality vertices in large graphs
  ☆8Updated 10 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago
• benedekrozemberczki / GraRep
  A SciPy implementation of "GraRep: Learning Graph Representations with Global Structural Information" (WWW 2015).
  ☆64Updated 2 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 6 years ago
• anthbapt / multixrank
  ☆17Updated 3 months ago
• mims-harvard / ohmnet
  OhmNet: Representation learning in multi-layer graphs
  ☆82Updated 4 years ago
• giannisnik / k-clique-graphs-dense-subgraphs
  ☆16Updated 8 years ago
• mims-harvard / fusenet
  Network inference by fusing data from diverse distributions
  ☆14Updated 8 years ago
• chrsmrrs / k-gnn
  Source code for our AAAI paper "Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks".
  ☆187Updated 3 years ago
• xiangyue9607 / BioNEV
  Graph Embedding Evaluation / Code and Datasets for "Graph Embedding on Biomedical Networks: Methods, Applications, and Evaluations" (Bi…
  ☆226Updated 4 years ago