Alternatives and similar repositories for Density-Friendly

Users that are interested in Density-Friendly are comparing it to the libraries listed below

• kijungs / corescope
  CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)
  ☆16Updated last year
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆88Updated 6 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated last month
• LJeub / LocalCommunities
  Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …
  ☆13Updated 7 years ago
• kfoynt / LocalGraphClustering
  ☆144Updated 4 years ago
• HanKruiger / tsnetwork
  (PLEASE USE https://github.com/HanKruiger/tsNET) This is here for historical purpose only.
  ☆10Updated 6 years ago
• dongwookim-ml / MMSB
  mixed membership stochastic block model
  ☆13Updated 9 years ago
• KarypisLab / K-Truss
  OpenMP-based parallel software for computing the truss decomposition of a graph.
  ☆14Updated 7 years ago
• Murali-group / halp
  Hypergraph Algorithms Package
  ☆99Updated 2 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆80Updated 7 years ago
• galanisl / NetHypGeom
  Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.
  ☆27Updated 7 years ago
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 9 years ago
• TuftsBCB / Walker
  Python implementation of Kohler et al.'s random walk with restart
  ☆29Updated 7 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆133Updated 4 years ago
• egalimberti / polarized_communities
  Discovering Polarized Communities in Signed Networks
  ☆13Updated 6 years ago
• romain-fontugne / slpa_nx
  Community mining with Speaker-Listener Label Propagation Algorithm (SLPA) for networkx graphs
  ☆28Updated 3 years ago
• networkx / networkx-metis
  NetworkX Addon to allow graph partitioning with METIS
  ☆80Updated 2 years ago
• bagrow / linkcomm
  Programs to identify link communities in complex networks
  ☆99Updated 4 years ago
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆55Updated 8 years ago
• ahollocou / walkscan
  Algorithms for local community detection in networks
  ☆26Updated 9 years ago
• trueprice / python-graph-clustering
  A collection of Python scripts that implement various graph clustering algorithms, specifically for identifying protein complexes from pr…
  ☆96Updated 7 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆102Updated 2 years ago
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆19Updated 6 years ago
• eXascaleInfolab / GenConvNMI
  Generalized Conventional Mutual Information (GenConvMI) - NMI for overlapping (soft, fuzzy) clusters (communities), compatible with stand…
  ☆21Updated 5 years ago
• cnmusco / graph-similarity-learning
  Algorithms for learning network structure from effective resistances and other random-walk-based similarities.
  ☆31Updated 7 years ago
• arbenson / higher-order-organization-julia
  Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".
  ☆40Updated 8 years ago
• uwescience / GossipMap
  GossipMap: distributed parallel community detection algorithm
  ☆22Updated 10 years ago
• lmcinnes / hypergraph
  A library for hypergraphs and hypergraph algorithms
  ☆28Updated 10 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆69Updated 3 years ago
• gtremper / Network-Motif
  Python wrapper for the Kavosh network motif finder
  ☆52Updated 11 years ago