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 8 months ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 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 7 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• giannisnik / k-clique-graphs-dense-subgraphs
  ☆15Updated 8 years ago
• rabbanyk / CommunityEvaluation
  A framework for evaluating community mining algorithms.
  ☆11Updated 9 years ago
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆54Updated 7 years ago
• eXascaleInfolab / PyCABeM
  Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…
  ☆19Updated 6 years ago
• yuj-umd / fastsc
  A fast implementation of spectral clustering on GPU-CPU Platform
  ☆32Updated 7 years ago
• dongwookim-ml / MMSB
  mixed membership stochastic block model
  ☆13Updated 9 years ago
• Murali-group / halp
  Hypergraph Algorithms Package
  ☆98Updated 2 years ago
• KarypisLab / K-Truss
  OpenMP-based parallel software for computing the truss decomposition of a graph.
  ☆14Updated 7 years ago
• networkx / networkx-metis
  NetworkX Addon to allow graph partitioning with METIS
  ☆79Updated 2 years ago
• uwescience / GossipMap
  GossipMap: distributed parallel community detection algorithm
  ☆22Updated 9 years ago
• athomo / kcore
  ☆12Updated 7 years ago
• DAMA-UPC / SCD
  ☆30Updated 8 years ago
• prathasah / random-modular-network-generator
  Generates random graphs with tunable strength of community structure
  ☆28Updated 5 years ago
• edoliberty / frequent-directions
  Implements the frequent directions algorithm for approximating matrices in streams
  ☆32Updated 7 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆1Updated 4 years ago
• jdmoorman / uclasm
  Subgraph matching and isomorphisms in Python.
  ☆27Updated 2 years ago
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 8 years ago
• eXascaleInfolab / GenConvNMI
  Generalized Conventional Mutual Information (GenConvMI) - NMI for overlapping (soft, fuzzy) clusters (communities), compatible with stand…
  ☆21Updated 4 years ago
• liyanghua / Label-Propagation
  Label Propagation based Community Detection algorithm implemented using multiprocessing module in python (Please have a look at my othe…
  ☆9Updated 14 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago
• graphchallenge / GraphChallenge
  Graph Challenge
  ☆31Updated 5 years ago
• greyfoxamine / Overlapping-Community-Detection-Using-Seed-Set-Expansion-
  ☆8Updated 8 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆61Updated 4 years ago
• Sotera / distributed-louvain-modularity
  Community Detection and Compression Analytic for Big Graph Data
  ☆37Updated 11 years ago
• ntamas / plfit
  Fitting power-law distributions to empirical data, according to the method of Clauset, Shalizi and Newman
  ☆50Updated 6 months ago
• romain-fontugne / slpa_nx
  Community mining with Speaker-Listener Label Propagation Algorithm (SLPA) for networkx graphs
  ☆27Updated 3 years ago